A locality-preserving cache-oblivious dynamic dictionary

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 29-38

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

^a Stony Brook University   (United States)

^b Polyechnic University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DATA STRUCTURES; MEMORY ARCHITECTURE; TREES (MATHEMATICS);

BLOCK OPERATIONS; CACHE-OBLIVIOUS; DYNAMIC DICTIONARIES; HIERARCHICAL MEMORY; LOCALITY-PRESERVING; MEMORY HIERARCHY; MEMORY PERFORMANCE; SEARCH OPERATIONS;

CACHE MEMORY;

EID: 84968830614     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (49)

1. G. M. Add'son-Vel'skii and E. M. Lantus. An algorithm for organization of information (in Russian). Doklady Akademii Nauk SSSR, 146:263-266, 1962.
2. A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir. A model for hierarchical memory. In Proc. ACM Symp. on Theory of Computing, pages 305-314, 1987.
3. A. Aggarwal and A. K. Chandra. Virtual memory algorithms. In Proc. ACM Symp. on Theory of Computation, pages 173-185, 1988.
4. A. Aggarwal, A. K. Chandra, and M. Snir. Hierarchical memory with block transfer. In Proc. IEEE Symp. on Foundations of Computer Science, pages 204-216, 1987.
5. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, 1988.
6. B. Alpern, L. Carter, E. Feig, and T. Selker. The uniform memory hierarchy model of computation. Algorithmica, 12(2-3):72-109, 1994.
7. A. Andersson. Faster deterministic sorting and searching in linear space. In Proc. Symp. Foundations of Computer Science (FOCS), pages 135-141, 1996.
8. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. ACM Symp, on Theory of Computing, pages 335-342, 2000.
9. L. Arge, K. Hinrichs, and J. Vitter. Efficient bulk operations on dynamic r-trees. In ALENEX, pages 328-348, 1999.
10. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173-189, 1972.
11. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc Symp. on Foundations of Computer Science, pages 399-409, 2000.
12. G. Bilardi, P. D'Alberto, and A. Nicolau. Fractal matrix multiplications: a case study on portability of cache performance. In Proc. Workshop on Algorithm Engineering, pages 26-38, 2001.
13. 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 Proc. ACM Symp. on Parallel Algorithms and Architectures, pages 297-308, 1996.
14. G. S. Brodal, R. Fagerberg, and R, Jacob. Cache oblivious search trees via binary trees of small height (extended abstract). In Proc. ACM-SIAM Symp. on Discrete Algorithms, 2002.
15. M. R. Brown and R. E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput, 9:594-614, 1980.
16. D. Carlson. Software design using C++. http://cis.stvincent.edu/carlsond/swdeaign/swd.html, 2001.
17. D. Comer. The ubiquitous B-tree. ACM Computing Surveys, 11(2):121-137, 1979.
18. J. V. den Bercken, B. Seeger, and P. Widmayer. A generic approach to bulk loading multidimensional index structures. In M. Jarke, M. J. Carey, K. R-Dittrich, F. H. Lochovsky, P. Loucopoulos, and M. A. Jeusfeld, editors, Proc. International Conference on Very Large Data Bases, 1997, , pages 406-415, 1997.
19. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ra-machandran. Cache-oblivious algorithms. In Proc. Symp. on Foundations of Computer Science, pages 285-297, 1999.
20. J. Gray and G. Graefe. The five minute rule ten years later. SIGMOD Record, 26(4), 1997.
21. L. J. Guibas and R. Sedge wick. A dichromatic framework for balanced trees. In Proc. Symp. on Foundations of Computer Science, pages 8-21, 1978.
22. S. Huddleston and K. Mehlhom. A new data structure for representing sorted lists. Acta Informatica, 17:157-184, 1982.
23. J. Iacono. Alternatives to splay trees with O(logn) worst-case access times. In Proc. Symp. on Discrete Algorithms, pages 516-522, 2001.
24. A. Itai, A. G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. Annual International Colloquium on Automata, Languages, and Programming, LNCS 115, pages 417-431, 1981.
25. I. Kamel and C. Faloutsos. On packing R-trees. In Proc. International Conference on Information and Knowledge Management, pages 490-499, 1993.
26. K. Kim and S. K. Cha. Sibling clustering of tree-based spatial indexes for efficient spatial query processing. In Proc. ACM Intl. Conf. Information and Knowledge Management, pages 398-405, 1998.
27. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading MA, second edition, 1998.
28. R. L. Kruse and A. J. Ryba. Data strcutres and program design in C++. Prentice-Hall, Upper Saddle River, New Jersey, 1998.
29. R. Meville and D. Gries. Controlled density sorting. Infor. Process. Lett., 10:169-172, 1980.
30. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. SIAM Journal on Computing, 2:33-43, 1973.
31. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
32. H. Prokop. Cache-oblivious algorithms. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1999.
33. W. Pugh. Skip lists: a probabilistic alternative to balanced trees. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Proc. Workshop on Algorithms and Data Structures, volume 382 of LNCS, pages 437-449, 1989.
34. N. Rahman, R. Cole, and R. Raman. Optimized predecessor data structures for internal memory. In Proc. Workshop on Algorithms Engineering , pages 67-78, August 2001.
35. V.Raman. Locality preserving dictionaries: theory and application to clustering in databases. In Proc. ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1999.
36. J. E. Savage. Extending the Hong-Kung model to memory hierachies. In Proc. International Conference on Computing and Combinatorics, volume 959 of LNCS, pages 270-281, 1995.
37. R. Seidel and C. R. Aragón. Randomized search trees. Algorithmica, 16(4-5):464-497, 1996.
38. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, July 1985.
39. M. Thorup. Faster deterministic sorting and priority queues in linear space. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 550-555, 1998.
40. S. Toledo. Locality of reference in LU decomposition with partial pivoting. SIAM Journal on Matrix Analysis and Applications, 18(4):1065-1081, Oct. 1997.
41. P. van Emde Boas. Preserving order in a forest in less than logarithmic time. In Proc. Symp. on Foundations of Computer Science, pages 75-84, 1975.
42. P. van Erode Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10(2):99-127, 1977.
43. J. S. Vitter. External memory algorithms and data structures. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualisation, pages 1-38. American Mathematical Society, DIMACS series in Discrete Mathematics and Theoretical Computer Science, 1999.
44. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory II: Hierarchical multilevel memories. Algorithmica, 12(2-3) :148-169, 1994.
45. D. E. Willard. Inserting and deleting records in blocked sequential files. Technical Report TM81-45193-5, Bell Laboratories, 1981.
46. D. E. Willard. Maintaining dense sequential files in a dynamic environment. In Proc. ACM Symp. on Theory of Computation, pages 114-121, 1982.
47. D. E. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In Proc. SIGMOD Intl. Conf. on Management of Data, pages 251-260, 1986.
48. 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, 1992.
49. Q. Yi, V. Advi, and K. Kennedy. Transforming loops to recursion for multi-level memory hierarchies. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 169-181, 2000.