Implementing sorting in database systems

被引:76
作者
Graefe, Goetz [1 ]
机构
[1] Microsft Inc, Redmond, WA 98052 USA
关键词
algorithms; performance; key normalization; key conditioning; compression; dynamic memory resource allocation; graceful degradation; nested iteration; asynchronous read-ahead; forecasting; index operations;
D O I
10.1145/1132960.1132964
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Most commercial database systems do ( or should) exploit many sorting techniques that are publicly known, but not readily available in the research literature. These techniques improve both sort performance on modern computer systems and the ability to adapt gracefully to resource fluctuations in multiuser operations. This survey collects many of these techniques for easy reference by students, researchers, and product developers. It covers in-memory sorting, disk-based external sorting, and considerations that apply specifically to sorting in database systems.
引用
收藏
页数:37
相关论文
共 53 条
[1]  
AGARWAL RC, 1996, P ACM SIGMOD INT C M, P240
[2]  
Aho A. V., 1983, DATA STRUCTURES ALGO
[3]  
Andersson A., 1998, ACM Journal of Experimental Algorithmics, V3, DOI 10.1145/297096.297136
[4]  
[Anonymous], 1980, THESIS CASE W RESERV
[5]  
[Anonymous], P C INN DAT SYST RES
[6]   Order preserving string compression [J].
Antoshenkov, G ;
Lomet, D ;
Murray, J .
PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1996, :655-663
[7]  
ARPACIDUSSEAU AC, 1997, P ACM SIGMOD INT C M, P243
[8]   IMPROVING QUICKSORT PERFORMANCE WITH A CODEWORD DATA STRUCTURE [J].
BAER, JL ;
LIN, YB .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (05) :622-631
[9]  
Barclay T., 1994, SIGMOD Record, V23, P72, DOI 10.1145/190627.190647
[10]   USING SEMI-JOINS TO SOLVE RELATIONAL QUERIES [J].
BERNSTEIN, PA ;
CHIU, DMW .
JOURNAL OF THE ACM, 1981, 28 (01) :25-40