This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Main Memory Indexing: The Case for BD-Tree
July 2004 (vol. 16 no. 7)
pp. 870-874
Jianwen Su, IEEE
Kian-Lee Tan, IEEE Computer Society

Abstract—In this paper, we adapt and optimize the BD-tree for main memory data processing. We compare the memory-based BD-tree against the {\rm{B}}^+{\hbox{-}}{\rm{tree}} and {\rm{CSB}}^+{\hbox{-}}{\rm{tree}}. 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.

[1] The Calibrator Tool,http://www.cwi.nl/manegoldCalibrator/, 1999.
[2] The Perfmon Tool,http://www.cps.msu.edu/enbodyperfmon.html , 1999.
[3] A. Ailamaki, D.J. DeWitt, M.D. Hill, and D.A. Wood, DBMS on a Modern Processor: Where Does Time Go Proc. 25th Very Large Databases Conf., pp. 266-277, 1999.
[4] P. Bohannon, P. Mcllroy, and R. Rastogi, Main-Memory Index Structures with Fixed-Size Partial Keys Proc. ACM SIGMOD, pp. 163-174, 2001.
[5] A. Cardenas, Analysis and Performance of Inverted Database Structures Comm. ACM, vol. 18, pp. 253-264, May 1975.
[6] S. Chen, P.B. Gibbons, and T.C. Mowry, Improving Index Performance through Prefetching Proc. ACM SIGMOD, pp. 139-150, 2001.
[7] S. Chen, P.B. Gibbons, T.C. Mowry, and G. Valentin, Fractal Prefeching B+-Tree: Optimizing Both Cache and Disk Performance Proc. ACM SIGMOD, pp. 157-168, 2002.
[8] B. Cui, B.C. Ooi, J.W. Su, and K.L. Tan, Using BD-Tree for Main Memory Processing technical report, School of Computing, Nat'l Univ. of Singapore, 2003.
[9] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kauffman, 1998.
[10] T. Lehman and M. Carey, A Study of Index Structures for Main Memory Database Management Systems Proc. 12th Very Large Databases Conf., pp. 294-303, 1986.
[11] W. Litwin and D. Lomet, The Bounded Disorder Access Method Proc. 17th Int'l Conf. Data Eng., pp. 38-48, 1986.
[12] J. Rao and K. Ross, Making B+-Trees Cache Conscious in Main Memory Proc. ACM SIGMOD, pp. 475-486, 2000.

Index Terms:
Main memory databases, BD-tree, {\rm{B}}^+{\hbox{-}}{\rm{tree}}, {\rm{CSB}}^+{\hbox{-}}{\rm{tree}}.
Citation:
Bin Cui, Beng Chin Ooi, Jianwen Su, Kian-Lee Tan, "Main Memory Indexing: The Case for BD-Tree," IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 7, pp. 870-874, July 2004, doi:10.1109/TKDE.2004.1318568
Usage of this product signifies your acceptance of the Terms of Use.