Making B⁺-Trees Cache Conscious in Main Memory.

@inproceedings{DBLP:conf/sigmod/RaoR00,
  author    = {Jun Rao and
               Kenneth A. Ross},
  editor    = {Weidong Chen and
               Jeffrey F. Naughton and
               Philip A. Bernstein},
  title     = {Making B$^{\mbox{+}}$-Trees Cache Conscious in Main Memory},
  booktitle = {Proceedings of the 2000 ACM SIGMOD International Conference on
               Management of Data, May 16-18, 2000, Dallas, Texas, USA},
  publisher = {ACM},
  year      = {2000},
  isbn      = {1-58113-218-2},
  pages     = {475-486},
  ee        = {http://doi.acm.org/10.1145/342009.335449, db/conf/sigmod/RaoR00.html},
  crossref  = {DBLP:conf/sigmod/2000},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 2000 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Online Edition

References

[ADW99]

Anastassia Ailamaki, David J. DeWitt, Mark D. Hill, David A. Wood: DBMSs on a Modern Processor: Where Does Time Go? VLDB 1999: 266-277 BibTeX

[BBC+98]

Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, Jeffrey D. Ullman: The Asilomar Report on Database Research. SIGMOD Record 27(4): 74-80(1998) BibTeX

[BMK99]

Peter A. Boncz, Stefan Manegold, Martin L. Kersten: Database Architecture Optimized for the New Bottleneck: Memory Access. VLDB 1999: 54-65 BibTeX

[CLH98]

...

[Com79]

Douglas Comer: The Ubiquitous B-Tree. ACM Comput. Surv. 11(2): 121-137(1979) BibTeX

[Enb99]

...

[Eng98]

...

[HP96]

John L. Hennessy, David A. Patterson: Computer Architecture: A Quantitative Approach, 2nd Edition. Morgan Kaufmann 1996, ISBN 1-55860-329-8
BibTeX

[Inc99]

...

[Ker89]

Martin L. Kersten: Using Logarithmic Code-Expansion to Speedup Index Access and Maintenance. FODO 1989: 228-232 BibTeX

[LC86]

Tobin J. Lehman, Michael J. Carey: A Study of Index Structures for Main Memory Database Management Systems. VLDB 1986: 294-303 BibTeX

[O'N92]

Patrick E. O'Neil: The SB-Tree: An Index-Sequential Structure for High-Performance Sequential Access. Acta Inf. 29(3): 241-265(1992) BibTeX

[Pro99]

...

[Ram97]

Raghu Ramakrishnan: Database Management Systems. WCB/McGraw-Hill 1998, ISBN 0-07-050775-9
BibTeX

[RR99]

Jun Rao, Kenneth A. Ross: Cache Conscious Indexing for Decision-Support in Main Memory. VLDB 1999: 78-89 BibTeX

[SKN94]

Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton: Cache Conscious Algorithms for Relational Query Processing. VLDB 1994: 510-521 BibTeX

[Smi82]

Alan Jay Smith: Cache Memories. ACM Comput. Surv. 14(3): 473-530(1982) BibTeX

[TMJ98]

Kristian Torp, Leo Mark, Christian S. Jensen: Efficient Differential Timeslice Computation. IEEE Trans. Knowl. Data Eng. 10(4): 599-611(1998) BibTeX

[Wri85]

William E. Wright: Some Average Performance Measures for the B-Tree. Acta Inf. 21: 541-557(1985) BibTeX

[Yao78]

Andrew Chi-Chih Yao: On Random 2-3 Trees. Acta Inf. 9: 159-170(1978) BibTeX