A locality-preserving cache-oblivious dynamic dictionary

Journal of Algorithms

Volumn 53, Issue 2, 2004, Pages 115-136

  Bender, Michael A ^a   Duan, Ziyang ^a   Iacono, John ^b   Wu, Jing ^a  

^a Stony Brook University   (United States)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTER SIMULATION; DATA STRUCTURES; DATABASE SYSTEMS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

BLOCK TRANSFERS; DICTIONARY STRUCTURE; MEMORY HIERARCHY; PARAMETERIZATION;

GLOSSARIES;

EID: 3943062182     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2004.04.014     Document Type: Article

References (60)

1. Adel'son-Vel'skiî G.M., Landis E.M. An algorithm for organization of information. Dokl. Akad. Nauk SSSR. 146:1962;263-266. (in Russian).
2. Agarwal P.K., Arge L., Danner A., Holland-Minkley B. Cache-oblivious data structures for orthogonal range searching. Proceedings of 19th Annual ACM Symposium on Computational Geometry, San Diego, CA. 2003;237-245.
3. Aggarwal A., Alpern B., Chandra A.K., Snir M. A model for hierarchical memory. Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York. 1987;305-314.
4. Aggarwal A., Chandra A.K. Virtual memory algorithms. Proceedings of the ACM Symposium on Theory of Computation. 1988;173-185.
5. Aggarwal A., Chandra A.K., Snir M. Hierarchical memory with block transfer. Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA. 1987;204-216.
6. Aggarwal A., Vitter J.S. The input/output complexity of sorting and related problems. Comm. ACM. 31:(9):1988;1116-1127.
7. Alpern B., Carter L., Feig E., Selker T. The uniform memory hierarchy model of computation. Algorithmica. 12:(2-3):1994;72-109.
8. Alstrup S., Bender M.A., Demaine E.D., Farach-Colton M., Munro J.I., Rauhe T., Thorup M. Efficient tree layout in a multilevel memory hierarchy. http://www.arXiv.org/abs/cs.DS/0211010:2002;
9. Andersson A. Faster deterministic sorting and searching in linear space. Proceedings of the 37th Annual Symposium on Foundations of Computer Science. 1996;135-141.
10. Andersson A., Thorup M. Tight(er) worst-case bounds on dynamic searching and priority queues. Proceedings of the 31st Annual ACM Symposium on Theory of Computing. 2000;335-342.
11. Arge L., Bender M.A., Demaine E.D., Holland-Minkley B., Munro J.I. Cache-oblivious priority queue and graph algorithm applications. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montréal, Canada. 2002;268-276.
12. Bayer R., McCreight E.M. Organization and maintenance of large ordered indexes. Acta Informatica. 1:(3):1972;173-189.
13. Bender M.A., Brodal G.S., Fagerberg R., Ge D., He S., Hu H., Iacono J., López-Ortiz A. The cost of cache-oblivious searching. Proceedings of the 44th Annual Symposium on Foundations of Computer Science, Cambridge, MA. 2003;271-282.
14. Bender M.A., Cole R., Demaine E.D., Farach-Colton M. Scanning and traversing: maintaining data for traversals in a memory hierarchy. Proceedings of the 10th Annual European Symposium on Algorithms, Rome, Italy. Lecture Notes in Comput. Sci. vol. 2461:2002;139-151.
15. Bender M.A., Cole R., Raman R. Exponential structures for efficient cache-oblivious algorithms. Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Málaga, Spain. Lecture Notes in Comput. Sci. vol. 2380:2002;195-207.
16. Bender M.A., Demaine E., Farach-Colton M. Cache-oblivious B-trees. Proceedings of the 41st Annual Symposium on Foundations of Computer Science. 2000;399-409.
17. Bender M.A., Demaine E.D., Farach-Colton M. Efficient tree layout in a multilevel memory hierarchy. Proceedings of the 10th Annual European Symposium on Algorithms, Rome, Italy. Lecture Notes in Comput. Sci. vol. 2461:2002;165-173.
18. Bender M.A., Duan Z., Iacono J., Wu J. A locality-preserving cache-oblivious dynamic dictionary. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 2002;29-38.
19. Brodal G.S., Fagerberg R. Cache oblivious distribution sweeping. Proceedings of the 29th International Colloquium on Automata, Languages, and Programming, Malaga, Spain. Lecture Notes in Comput. Sci. vol. 2380:2002;426-438.
20. Brodal G.S., Fagerberg R. Funnel heap - a cache oblivious priority queue. Proceedings of the 13th Annual International Symposium on Algorithms and Computation, Vancouver, Canada. Lecture Notes in Comput. Sci. vol. 2518:2002;219-228.
21. Brodal G.S., Fagerberg R. On the limits of cache-obliviousness. Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA. 2003;307-315.
22. Brodal G.S., Fagerberg R., Jacob R. Cache oblivious search trees via binary trees of small height (extended abstract). Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms. 2002;39-48.
23. Brown M.R., Tarjan R.E. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput. 9:1980;594-614.
24. Carlson D. Software design using C++. http://cis.stvincent.edu/carlsond/ swdesign/swd.html:2001;
25. Comer D. The ubiquitous B-tree. ACM Comput. Surveys. 11:(2):1979;121-137.
26. den Bercken J.V., Seeger B., Widmayer P. A generic approach to bulk loading multidimensional index structures. Jarke M., Carey M.J., Dittrich K.R., Lochovsky F.H., Loucopoulos P., Jeusfeld M.A. VLDB'97, Proceedings of 23rd International Conference on Very Large Data Bases, August 25-29, 1997, Athens, Greece. 1997;406-415 Kaufmann.
27. Franceschini G., Grossi R. Optimal cache-oblivious implicit dictionaries. Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Comput. Sci. vol. 2719:2003;316-331.
28. Franceschini G., Grossi R. Optimal worst-case operations for implicit cache-oblivious search trees. Proceedings of the 8th Workshop on Algorithms and Data Structures (WADS). 2003;114-126. in press.
29. Frigo M., Leiserson C.E., Prokop H., Ramachandran S. Cache-oblivious algorithms. Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York. 1999;285-297.
30. Gray J., Graefe G. The five minute rule ten years later. SIGMOD Record. 26:(4):1997.
31. Guibas L.J., Sedgewick R. A dichromatic framework for balanced trees. Proceedings of the 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, MI. 1978;8-21.
32. Huddleston S., Mehlhorn K. A new data structure for representing sorted lists. Acta Informatica. 17:1982;157-184.
33. Iacono J. Alternatives to splay trees with o(logn) worst-case access times. Proceedings of the 11th Symposium on Discrete Algorithms. 2001;516-522.
34. Itai A., Konheim A.G., Rodeh M. A sparse table implementation of priority queues. Even S., Kariv O. Proceedings of the 8th Colloquium on Automata, Languages, and Programming, Acre (Akko), Israel. Lecture Notes in Comput. Sci. vol. 115:1981;417-431.
35. Kamel I., Faloutsos C. On packing R-trees. Proc. International Conference on Information and Knowledge Management. 1993;490-499.
36. Kim K., Cha S.K. Sibling clustering of tree-based spatial indexes for efficient spatial query processing. Proc. ACM Internat. Conf. Information and Knowledge Management. 1998;398-405.
37. Knuth D.E. Sorting and Searching. The Art of Computer Programming, vol. 3. second ed. 1998;Addison-Wesley, Reading MA.
38. Kruse R.L., Ryba A.J. Data Structures and Program Design in C++. 1998;Prentice-Hall, Upper Saddle River, NJ.
39. P. Kumar, E. Ramos, I/O-efficient construction of Voronoi diagrams, Manuscript, 2003.
40. Ladner R.E., Fortna R., Nguyen B.-H. A comparison of cache aware and cache oblivious static search trees using program instrumentation. Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software. Lecture Notes in Comput. Sci. vol. 2547:2002;78-92.
41. Arge L., Hinrichs K., Vahrenhold J., Vitter J. Efficient bulk operations on dynamic r-trees. ALENEX. 1999;328-348.
42. Meville R., Gries D. Controlled density sorting. Inform. Process. Lett. 10:1980;169-172.
43. Nievergelt J., Reingold E.M. Binary search trees of bounded balance. SIAM J. Comput. 2:1973;33-43.
44. P. Morin, Putting your dictionary on a diet, Technical Report TR-02-07, Carleton University School of Computer Science, November 2002.
45. H. Prokop, Cache-oblivious algorithms, Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
46. Pugh W. Skip lists: a probabilistic alternative to balanced trees. Dehne F., Sack J.-R., Santoro N. Proceedings of the Workshop on Algorithms and Data Structures, Ottawa, ON, Canada. Lecture Notes in Comput. Sci. vol. 382:1989;437-449.
47. Rahman N., Cole R., Raman R. Optimized predecessor data structures for internal memory. Proceedings of the 5th Workshop on Algorithms Engineering, Aarhus, Denmark. 2001;67-78.
48. Raman V. Locality preserving dictionaries: theory and application to clustering in databases. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. 1999.
49. Savage J.E. Extending the Hong-Kung model to memory hierarchies. Proceedings of the 1st Annual International Conference on Computing and Combinatorics. Lecture Notes in Comput. Sci. vol. 959:1995;270-281.
50. Seidel R., Aragon C.R. Randomized search trees. Algorithmica. 16:(4-5):1996;464-497.
51. Sleator D.D., Tarjan R.E. Self-adjusting binary search trees. J. ACM. 32:(3):1985;652-686.
52. Thorup M. Faster deterministic sorting and priority queues in linear space. Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms. 1998;550-555.
53. van Emde Boas P. Preserving order in a forest in less than logarithmic time. Proceedings of the 16th Annual Symposium on Foundations of Computer Science, Berkeley, CA. 1975;75-84.
54. van Emde Boas P., Kaas R., Zijlstra E. Design and implementation of an efficient priority queue. Math. Systems Theory. 10:(2):1977;99-127.
55. Vitter J.S. External memory algorithms and data structures. Abello J., Vitter J.S. External Memory Algorithms and Visualization. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 1999;1-38 Amer. Math. Soc.
56. Vitter J.S., Shriver E.A.M. Algorithms for parallel memory, II: Hierarchical multilevel memories. Algorithmica. 12:(2-3):1994;148-169.
57. D.E. Willard, Inserting and deleting records in blocked sequential files, Technical Report TM81-45193-5, Bell Laboratories, 1981.
58. Willard D.E. Maintaining dense sequential files in a dynamic environment. Proceedings of the 14th Annual ACM Symposium on Theory of Computing, San Francisco, CA. 1982;114-121.
59. Willard D.E. Good worst-case algorithms for inserting and deleting records in dense sequential files. Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, Washington, DC. 1986;251-260.
60. Willard D.E. A density control algorithm for doing insertions and deletions in a sequentially ordered file in good worst-case time. Inform. and Comput. 97:(2):1992;150-204.