Cache-oblivious B-trees

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 399-409

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

^a Stony Brook University   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; COMPUTATIONAL COMPLEXITY; DATA REDUCTION; STORAGE ALLOCATION (COMPUTER);

DYNAMIC SEARCH-TREE DATA STRUCTURES;

DATA STRUCTURES;

EID: 0034497787     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892128     Document Type: Article

References (43)

1. 1999 COMPAQ http://ftb.digital.com/pub/Digital/info/semiconductor/literature/dsc-li%brary. html
2. P. F. Dietz D. D. Sleator Two algorithms for maintaining order in a list Proc. 19th ACM Sympos. Theory of Computing 365 372 Proc. 19th ACM Sympos. Theory of Computing New York 1987-May
3. M. L. Fredman D. E. Willard Surpassing the information theoretic bound with fusion trees J. Comput. System Sci. 47 3 424 436 1993
4. M. Frigo A fast Fourier transform compiler ACM SIGPLAN Notices 34 5 169 180 May 1999
5. M. Frigo C. E. Leiserson H. Prokop S. Ramachandran Cache-oblivious algorithms Proc. 40th IEEE Sympos. Found. Comp. Sci. 285 297 Proc. 40th IEEE Sympos. Found. Comp. Sci. New York 1999-Oct.
6. L. J. Guibas R. Sedgewick A dichromatic framework for balanced trees Proc. 19th IEEE Sympos. Found. Comp. Sci. 8 21 Proc. 19th IEEE Sympos. Found. Comp. Sci. Ann Arbor Michigan 1978
7. J.-W. Hong H. T. Kung I/O complexity: The red-blue pebble game Proc. 13th ACM Sympos. Theory of Computation 326 333 Proc. 13th ACM Sympos. Theory of Computation Milwaukee Wisconsin 1981-May
8. A. Itai A. G. Konheim M. Rodeh A sparse table implementation of priority queues Proc. 8th Colloquium on Automata, Languages, and Programming 115 417 431 Proc. 8th Colloquium on Automata, Languages, and Programming 1981-July
9. A. LaMarca R. Ladner The influence of caches on the performance of sorting Proc. 8th ACM-SIAM Symposium on Discrete Algorithms 370 379 Proc. 8th ACM-SIAM Symposium on Discrete Algorithms 1997-Jan.
10. K. Mehlhorn Data Structures and Algorithms 1: Sorting and Searching 5 198 199 1984 Springer-Verlag
11. J. Nievergelt E. M. Reingold Binary search trees of bounded balance SIAM J. Comput. 2 33 43 1973
12. M. Nodine J. Vitter Greed sort: Optimal deterministic sorting on parallel disks Journal of the ACM 42 4 919 933 July 1995
13. H. Overmars The Design of Dynamic Data Structures 156 1983 Springer-Verlag
14. H. Prokop Cache-oblivious algorithms June 1999 MA, Cambridge
15. W. Pugh Skip lists: a probabilistic alternative to balanced trees Proc. Workshop on Algorithms and Data Structures 382 437 449 Proc. Workshop on Algorithms and Data Structures Ottawa Canada 1989-Aug.
16. C. Ruemmier J. Wilkes An introduction to disk drive modeling IEEE Computer 27 3 17 29 1994
17. J. E. Savage Extending the Hong-Kung model to memory hierachies Proc. 1st Internal. Conf. Computing and Combinatorics 959 270 281 Proc. 1st Internal. Conf. Computing and Combinatorics 1995-Aug.
18. R. Seidel C. R. Aragon Randomized search trees Algorithmica 16 4-5 464 497 1996
19. S. Sen S. Chatterjee Towards a theory of cache-efficient algorithms Proc. 11th ACM-SIAM Sympos. Discrete Algorithms 829 838 Proc. 11th ACM-SIAM Sympos. Discrete Algorithms San Francisco 2000-Jan.
20. R. C. Singleton Programs for Digital Signal Processing 1979 IEEE Press Mixed radix fast fourier tranforms
21. D. D. Sleator R. E. Tarjan Amortized efficiency of list update and paging rules Comm. ACM 28 2 202 208 1985
22. D. D. Sleator R. E. Tarjan Self-adjusting binary search trees Journal of the ACM 32 3 652 686 July 1985
23. S. Toledo Locality of reference in LU decomposition with partial pivoting SIAM Journal on Matrix Analysis and Applications 18 4 1065 1081 Oct. 1997
24. P. van Emde Boas Preserving order in a forest in less than logarithmic time Proc. 16th IEEE Sympos. Found. Comp. Sci. 75 84 Proc. 16th IEEE Sympos. Found. Comp. Sci. Berkeley California 1975
25. P. van Emde Boas R. Kaas E. Zijlstra Design and implementation of an efficient priority queue Math. Systems Thoery 10 2 99 127 1977
26. J. S. Vitter External memory algorithms 1461 1998
27. J. S. Vitter E. A. M. Shriver Algorithms for parallel memory I: Two-level memories Algorithmica 12 2-3 110 147 1994
28. J. S. Vitter E. A. M. Shriver Algorithms for parallel memory II: Hierarchical multilevel memories Algorithmica 12 2-3 148 169 1994
29. D. E. Willard Maintaining dense sequential files in a dynamic environment Proc. 14th ACM Sympos. Theory of Computing 114 121 Proc. 14th ACM Sympos. Theory of Computing San Francisco 1982-May
30. D. E. Willard Good worst-case algorithms for inserting and deleting records in dense sequential files Proc. 1986 ACM SIGMOD Internat. Conf. Management of Data 251 260 Proc. 1986 ACM SIGMOD Internat. Conf. Management of Data Washington, D.C. 1986-May
31. D. E. Willard A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time Information and Computation 97 2 150 204 Apr. 1992
32. A. C. C. Yao Should tables be sorted? Journal of the Association for Computing Machinery 28 3 615 628 1981
33. G. M. Adel'son-Vel'skil̆ E. M. Landis An algorithm for organization of information 146 263 266 1962 Doklady Akademii Nauk SSSR
34. A. Aggarwal B. Alpem A. K. Chandra M. Snir A model for hierarchical memory Proc. 19th ACM Sympos. Theory of Computing 305 314 Proc. 19th ACM Sympos. Theory of Computing New York 1987-May
35. A. Aggarwal A. K. Chandra M. Snir Hierarchical memory with block transfer Proc. 28th IEEE Sympos. Found. Comp. Sci. 204 216 Proc. 28th IEEE Sympos. Found. Comp. Sci. Los Angeles 1987-Oct.
36. A. Aggarwal J. S. Vitter The input/output complexity of sorting and related problems Comm. ACM 31 9 1116 1127 Sept. 1988
37. B. Alpern L. Carter E. Feig T. Selker The uniform memory hierarchy model of computation Algorithmica 12 2-3 72 109 1994
38. M. Andrews M. A. Bender L. Zhang New algorithms for the disk scheduling problem Proc. 37th IEEE Sympos. Found. Comp. Sci. 580 589 Proc. 37th IEEE Sympos. Found. Comp. Sci. 1996-Oct.
39. L. Arge The buffer tree: A new technique for optimal I/O-algorithms Proc. 4th Internat. Workshop on Algorithms and Data Structures 955 334 345 Proc. 4th Internat. Workshop on Algorithms and Data Structures Kingston Canada 1995-Aug.
40. L. Arge J. S. Vitter Optimal dynamic interval management in external memory Proc. 37th IEEE Sympos. Found. Comp. Sci. 560 569 Proc. 37th IEEE Sympos. Found. Comp. Sci. Burlington VT 1996-Oct.
41. R. D. Barve J. S. Vitter A theoretical framework for memory-adaptive algorithms Proc. 40th IEEE Sympos. Found. Comp. Sci. 273 284 Proc. 40th IEEE Sympos. Found. Comp. Sci. New York 1999-Oct.
42. R. Bayer E. M. McCreight Organization and maintenance of large ordered indexes Acta Informatica 1 3 173 189 Feb. 1972
43. R. D. Blumofe M. Frigo C. F. Joerg C. E. Leiserson K. H. Randall An analysis of dag-consistent distributed shared-memory algorithms Proc. 8th ACM Sympos. Parallel Algorithms and Architectures 297 308 Proc. 8th ACM Sympos. Parallel Algorithms and Architectures 1996-June