Cache-oblivious streaming B-trees

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2007, Pages 81-92

  Bender, Michael A ^a   Farach Colton, Martin ^b   Fineman, Jeremy T ^c   Fogel, Yonatan R ^a   Kuszmaul, Bradley C ^c   Nelson, Jelani ^c  

^a Stony Brook University   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Buffered repository tree; Cache oblivious B tree; Cascading array; Deamortized; Lookahead array; Shuttle tree

Indexed keywords

ARRAY PROCESSING; ASYMPTOTIC STABILITY; CASCADE CONNECTIONS; QUERY PROCESSING;

BUFFERED REPOSITORY TREE; CACHE-AWARE; CACHE-OBLIVIOUS LOOKAHEAD ARRAY (COLA); CASCADING ARRAY; LOOKAHEAD ARRAY; SHUTTLE TREE;

CACHE MEMORY;

EID: 35248857461     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1248377.1248393     Document Type: Conference Paper

References (21)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Commun. ACM, 31(9): 1116-1127, Sept. 1988.
2. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and. J. I. Munro. Cache-oblivious priority queue and graph algorithm, applications. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 268-276, Montréal, Canada, Québec, Canada, May 2002.
3. L. Arge and J. S. Vitter. Optimal external memory interval management. SIAM Journal on Computing, 32(6):1488-1508, 2003.
4. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. Acta Inf., 1(3): 173-189, Feb. 1972.
5. M. A. Bender, R. Cole, E. D. Demaine, and M. Farach-Collón. Scanning and traversing: Maintaining data for traversais in a memory hierarchy. In Proc. 10th Annual European Symp. on Algorithms (ESA), pages 139-151, Rome, Italy, Sept. 2002.
6. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. SIAM J. Comput, 35(2):341-358, 2005. An earlier version of this paper appeared in Proc. 41st Annual Symp. on Foundations of Computer Science (FOCS), pages 399-409, Redondo Beach, California, 2000.
7. M. A. Bender, Z. Duan, J. Iacono, and. J. Wu. A locality-preserving cache-oblivious dynamic dictionary. J. Algorithms, 3(2): 115-136, 2004.
8. M. A. Bender, M. Farach-Colton, and B. Kuszmaul. Cache-oblivious string B-trees. In Proc. 25th Symposium on Principles of Database Systems (PODS), pages 233-242, Chicago, Illinois, June 2006.
9. J. L. Bentley and J. B. Saxe. Decomposable searching problems i: Static-to-dynamic transformation. J. Algorithms, l(4):301-358, 1980.
10. G. S. Brodal and R. Fagerberg. Lower bounds for external, memory dictionaries. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 546-554, Baltimore, Maryland, May 2003.
11. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 39-48, San Francisco, California, Jan. 2002.
12. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. R. Westbrook. On external memory graph traversal. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 859-860, San Francisco, California, Jan. 2000.
13. B. Chazelle and L. J. Guibas. Fractional cascading: I. a data structuring technique. Algorithmica, 1(2): 133-162, 1986.
14. D. Comer. The ubiquitous B-tree. ACM Comput. Surv., 11(2):121-137, June 1979.
15. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symp. on Foundations of Computer Science (FOCS), pages 285-297, New York, New York, Oct. 1999.
16. I. Katriel. Implicit data structures based on local reorganizations. Master's thesis, Technion, Israel Inst, of Tech., Haifa, May 2002.
17. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 1973.
18. J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In. Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 367-375, Orlando, Florida, January 1992.
19. M. H. Overmars. The Design of Dynamic Data Structures. Springer, 1983.
20. H. Prokop. Cache-oblivious algorithms. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Inst of Tech., June 1999.
21. Sleepycat Software. The Berkeley Database. http://www.sleepycat.com, 2005.