DocumentCode :
3012916
Title :
B-tree indexes and CPU caches
Author :
Graefe, Goetz ; Larson, Per-Åke
Author_Institution :
Microsoft Corp., Redmond, WA, USA
fYear :
2001
fDate :
2001
Firstpage :
349
Lastpage :
358
Abstract :
Since many existing techniques for exploiting CPU caches in the implementation of B-tree indexes have not been discussed in the literature, most of them are surveyed. Rather than providing a detailed performance evaluation for one or two of them on some specific contemporary hardware, the purpose is to survey and to make widely available this heretofore-folkloric knowledge in order to enable, structure, and hopefully stimulate future research
Keywords :
cache storage; data mining; database indexing; tree data structures; B-tree indexes; CPU caches; online transaction processing; performance evaluation; Compaction; Concurrency control; Data structures; Databases; Decision support systems; Disk drives; Hardware; Indexing; Sorting; System software;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 2001. Proceedings. 17th International Conference on
Conference_Location :
Heidelberg
ISSN :
1063-6382
Print_ISBN :
0-7695-1001-9
Type :
conf
DOI :
10.1109/ICDE.2001.914847
Filename :
914847
Link To Document :
بازگشت