The Community for Technology Leaders
Green Image
Issue No. 07 - July (2004 vol. 16)
ISSN: 1041-4347
pp: 870-874
Jianwen Su , IEEE
Kian-Lee Tan , IEEE Computer Society
ABSTRACT
<p><b>Abstract</b>—In this paper, we adapt and optimize the BD-tree for main memory data processing. We compare the memory-based BD-tree against the <tmath>{\rm{B}}^+{\hbox{-}}{\rm{tree}}</tmath> and <tmath>{\rm{CSB}}^+{\hbox{-}}{\rm{tree}}</tmath>. We present cost models for exact match query for these indexes, including L2 cache and translation lookahead buffer (TLB) miss model and execution time model. We also implemented these structures and conducted experimental study. Our analytical and experimental results show that a well-tuned BD-tree is superior in most cases.</p>
INDEX TERMS
Main memory databases, BD-tree, {\rm{B}}^+{\hbox{-}}{\rm{tree}}, {\rm{CSB}}^+{\hbox{-}}{\rm{tree}}.
CITATION

K. Tan, B. C. Ooi, J. Su and B. Cui, "Main Memory Indexing: The Case for BD-Tree," in IEEE Transactions on Knowledge & Data Engineering, vol. 16, no. , pp. 870-874, 2004.
doi:10.1109/TKDE.2004.1318568
89 ms
(Ver 3.3 (11022016))