Cache-oblivious B-trees

SIAM Journal on Computing

Volumn 35, Issue 2, 2006, Pages 341-358

  Bender, Michael A ^a   Demaine, Erik D ^b   Farach Colton, Martin ^c  

^a Stony Brook University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Cache efficiency; Data structures; Memory hierarchy; Search trees

Indexed keywords

CACHE EFFICIENCY; MEMORY HIERARCHY; MEMORY TRANSFERS; SEARCH TREES;

BUFFER STORAGE; DATA STORAGE EQUIPMENT; DATA STRUCTURES; SEARCH ENGINES;

TREES (MATHEMATICS);

EID: 33645781806     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701389956     Document Type: Article

References (54)

1. P. K. AGARWAL, L. ARGE, A. DANNER, AND B. HOLLAND-MINKLEY, Cache-oblivious data structures for orthogonal range searching, in Proceedings of the 19th Annual ACM Symposium on Computational Geometry, San Diego, CA, 2003, pp. 237-245.
2. A. AGGARWAL, B. ALPERN, A. K. CHANDRA, AND M. SNIR, A model for hierarchical memory, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 305-314.
3. A. AGGARWAL, A. K. CHANDRA, AND M. SNIR, Hierarchical memory with block transfer, in Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987, pp. 204-216.
4. A. AGGARWAL AND J. S. VITTER, The input/output complexity of sorting and related problems, Comm. ACM, 31 (1988), pp. 1116-1127.
5. B. ALPERN, L. CARTER, E. FEIG, AND T. SELKER, The uniform memory hierarchy model of computation, Algorithmica, 12 (1994), pp. 72-109.
6. S. ALSTRUP, M. A. BENDER, E. D. DEMAINE, M. FARACH-COLTON, T. RAUHE, AND M. THORUP, Efficient Tree Layout in a Multilevel Memory Hierarchy, http://www.arXiv.org/abs/cs.DS/0211010 (2004).
7. M. ANDREWS, M. A. BENDER, AND L. ZHANG, New algorithms for the disk scheduling problem, Algorithmica, 32 (2002), pp. 277-301.
8. 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, Montreal, Canada, 2002, pp. 268-276.
9. L. ARGE, G. S. BRODAL, R. FAGERBERG, AND M. LAUSTSEN, Cache-oblivious planar orthogonal range searching and counting, in Proceedings of the 21st Annual ACM Symposium on Computational Geometry, Pisa, Italy, 2005, pp. 160-169.
10. L. ARGE, M. DE BERG, AND H. HAVERKORT, Cache-oblivious R-trees, in Proceedings of the 21st Annual ACM Symposium on Computational Geometry, Pisa, Italy, 2005, pp. 170-179.
11. L. ARGE AND J. S. VITTER, Optimal external memory interval management, SIAM J. Comput., 32 (2003), pp.1488-1508.
12. R. D. BARVE AND J. S. VITTER, A theoretical framework for memory-adaptive algorithms, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York, 1999, pp. 273-284.
13. R. BAYER AND E. M. MCCREIGHT, Organization and maintenance of large ordered indexes, Acta Inform., 1 (1972), pp. 173-189.
14. M. A. BENDER, G. S. BRODAL, R. FAGERBERG, D. GE, S. HE, H. HU, J. IACONO, AND A. LÓPEZ-ORTIZ, The cost of cache-oblivious searching, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003, pp. 271-282.
15. M. A. BENDER, R. COLE, E. D. DEMAINE, AND M. FARACH-COLTON, Scanning and traversing: Maintaining data for traversals in a memory hierarchy, in Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2461, Springer-Verlag, Berlin, 2002, pp. 139-151.
16. M. A. BENDER, R. COLE, E. D. DEMAINE, M. FARACH-COLTON, AND J. ZITO, Two simplified algorithms for maintaining order in a list, in Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2461, Springer-Verlag, Berlin, 2002, pp. 152-164.
17. M. A. BENDER, R. COLE, AND R. RAMAN, Exponential structures for efficient cache-oblivious algorithms, in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 195-207.
18. M. A. BENDER, E. D. DEMAINE, AND M. FARACH-COLTON, Cache-oblivious B-trees, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, 2000, pp. 399-409.
19. M. A. BENDER, E. D. DEMAINE, AND M. FARACH-COLTON, Efficient tree layout in a multilevel memory hierarchy, in Proceedings of the 10th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2461, Springer-Verlag, Berlin, 2002, pp. 165-173.
20. M. A. BENDER, Z. DUAN, J. IACONO, AND J. WU, A locality-preserving cache-oblivious dynamic dictionary, J. Algorithms, 53 (2004), pp. 115-136.
21. R. D. BLUMOFE, M. FRIGO, C. F. JOERG, C. E. LEISERSON, AND K. H. RANDALL, An analysis of dag-consistent distributed shared-memory algorithms, in Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, Padua, Italy, 1996, pp. 297-308.
22. G. S. BRODAL AND R. FAGERBERG, Cache oblivious distribution sweeping, in Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 2380, Springer-Verlag, Berlin, 2002, pp. 426-438.
23. G. S. BRODAL AND R. FAGERBERG, Funnel heap - a cache oblivious priority queue, in Proceedings of the 13th Annual International Symposium on Algorithms and Computation, Lecture Notes in Comput. Sci. 2518, Springer-Verlag, Berlin, 2002, pp. 219-228.
24. G. S. BRODAL AND R. FAGERBERG, On the limits of cache-obliviousness, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2003, pp. 307-315.
25. 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 (San Francisco, CA), SIAM, Philadelphia, 2002, pp. 39-48.
26. G. S. BRODAL, R. FAGERBERG, U. MEYER, AND N. ZEH, Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths, in Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 3111, Springer, 2004, pp. 480-492.
27. COMPAQ, Documentation Library, http://ftp.digital.com/pub/Digital/info/ semiconductor/literature/dsc-library.html (1999).
28. P. F. DIETZ AND D. D. SLEATOR, Two algorithms for maintaining order in a list, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, 1987, pp. 365-372.
29. G. FRANCESCHINI AND R. GROSSI, Optimal cache-oblivious implicit dictionaries, in Proceedings of the 30th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 2719, Springer-Verlag, Berlin, 2003, pp. 316-331.
30. G. FRANCESCHINI AND R. GROSSI, Optimal worst-case operations for implicit cache-oblivious search trees, in Proceedings of the 8th Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sec. 2748, Springer-Verlag, Berlin, pp. 114-126.
31. M. FRIGO, C. E. LEISERSON, H. PROKOP, AND S. RAMACHANDRAN, Cache-oblivious algorithms, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York, 1999, pp. 285-297.
32. J.-W. HONG AND H. T. KUNG, I/O complexity: The red-blue pebble game, in Proceedings of the 13th Annual ACM Symposium on Theory of Computing, Milwaukee, WI, 1981, pp. 326-333.
33. A. ITAI, A. G. KONHEIM, AND M. RODEH, A sparse table implementation of priority queues, in Proceedings of the 8th Colloquium on Automata, Languages, and Programming, S. Even and O. Kariv, eds., Lecture Notes in Comput. Sci. 115, Springer-Verlag, Berlin, 1981, pp. 417-431.
34. P. KUMAR AND E. RAMOS, I/O-Efficient Construction of Voronoi Diagrams, manuscript, 2003.
35. R. E. LADNER, R. FORTNA, AND B.-H. NGUYEN, A comparison of cache aware and cache oblivious static search trees using program instrumentation, in Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software, Lecture Notes in Comput. Sci. 2547, Springer-Verlag, Berlin, 2002, pp. 78-92.
36. A. LAMARCA AND R. E. LADNER, The influence of caches on the performance of sorting, J. Algorithms, 31 (1999), pp. 66-104.
37. J. I. MUNRO, T. PAPADAKIS, AND R. SEDGEWICK, Deterministic skip lists, in Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, FL), SIAM, Philadelphia, 1992, pp. 367-375.
38. J. NIEVERGELT AND E. M. REINGOLD, Binary search trees of bounded balance, SIAM J. Comput., 2 (1973), pp. 33-43.
39. M. H. OVERMARS, The Design of Dynamic Data Structures, Lecture Notes in Comput. Sci. 156, Springer-Verlag, Berlin, 1983.
40. H. PROKOP, Cache-Oblivious Algorithms, Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, 1999.
41. W. PUGH, Skip lists: A probabilistic alternative to balanced trees, in Proceedings of the Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 382, Springer-Verlag, Berlin, 1989, pp. 437-449.
42. N. RAHMAN, R. COLE, AND R. RAMAN, Optimised predecessor data structures for internal memory, in Proceedings of the 5th International Workshop on Algorithm Engineering, Lecture Notes in Comput. Sci. 2141, Springer-Verlag, Berlin, 2001, pp. 67-78.
43. C. RUEMMLER AND J. WILKES, An introduction to disk drive modeling, IEEE Comput., 27 (1994), pp. 17-29.
44. J. E. SAVAGE, Extending the Hong-Kung model to memory hierarchies, in Proceedings of the 1st Annual International Conference on Computing and Combinatorics, Lecture Notes in Comput. Sci. 959, Springer-Verlag, Berlin, 1995, pp. 270-281.
45. S. SEN AND S. CHATTERJEE, Towards a theory of cache-efficient algorithms, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA), SIAM, Philadelphia, 2000, pp. 829-838.
46. S. TOLEDO, Locality of reference in LU decomposition with partial pivoting, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 1065-1081.
47. P. VAN EMDE BOAS, Preserving order in a forest in less than logarithmic time, in Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, 1975, pp. 75-84.
48. P. VAN EMDE BOAS, R. KAAS, AND E. ZIJLSTRA, Design and implementation of an efficient priority queue, Math. Systems Theory, 10 (1977), pp. 99-127.
49. J. S. VITTER, External memory algorithms and data structures: Dealing with massive data, ACM Comput. Surveys, 33 (2001), pp. 209-271.
50. J. S. VITTER AND E. A. M. SHRIVER, Algorithms for parallel memory I: Two-level memories, Algorithmica, 12 (1994), pp. 110-147.
51. J. S. VITTER AND E. A. M. SHRIVER, Algorithms for parallel memory II: Hierarchical multilevel memories, Algorithmica, 12 (1994), pp. 148-169.
52. D. E. WILLARD, Maintaining dense sequential files in a dynamic environment, in Proceedings of the 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA, 1982, pp. 114-121.
53. D. E. WILLARD, Good worst-case algorithms for inserting and deleting records in dense sequential files, in Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, Washington, DC, 1986, pp. 251-260.
54. D. E. WILLARD, A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time, Inform, and Comput., 97 (1992), pp. 150-204.