Main memory indexing: The case for BD-tree

IEEE Transactions on Knowledge and Data Engineering

Volumn 16, Issue 7, 2004, Pages 870-874

  Cui, Bin ^a   Ooi, Beng Chin ^a   Su, Jianwen ^b   Tan, Kian Lee ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b University of California   (United States)

Author keywords

B + tree; BD tree; CSB + tree; Main memory databases

Indexed keywords

BD-TREES; CSB-TREES; MAIN MEMORY DATABASES; MAIN MEMORY INDEXING;

BUFFER STORAGE; CACHE MEMORY; COMPUTER HARDWARE; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; MATHEMATICAL MODELS; PROGRAM PROCESSORS; QUERY LANGUAGES; TREES (MATHEMATICS);

DATA PROCESSING;

EID: 3142695756     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2004.1318568     Document Type: Article

References (12)

1. The Calibrator Tool, http://www.cwi.nl/manegold/Calibrator/, 1999.
2. The Perfmon Tool, http://www.cps.msu.edu/enbody/perfmon.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.