Exponential structures for efficient cache-oblivious algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 195-207

  Bender, Michael A ^a   Cole, Richard ^b   Raman, Rajeev ^c  

^a Stony Brook University   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CACHE MEMORY; DATA STRUCTURES; DEPRECIATION;

CACHE-OBLIVIOUS; CACHE-OBLIVIOUS ALGORITHMS; DYNAMIC SEARCHING; HIERARCHICAL MEMORY; NUMBER OF BLOCKS; PLANAR POINT LOCATION; PLANAR POINT LOCATION PROBLEMS; PRE-PROCESSING;

LOCATION;

EID: 84869180878     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_18     Document Type: Conference Paper

References (25)

1. A. Aggarwal and J. S. Vitter. The I/O complexity of sorting and related problems. Communications of the ACM 31, 1116-1127, 1988.
2. A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proc. 25th VLDB Conference (1999), pp 266-277.
3. A. Andersson. Faster Deterministic Sorting and Searching in Linear Space. In Proc. 37th IEEE FOCS (1996), pp. 135-141.
4. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. 31st ACM STOC (2000), pp. 335-342.
5. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, eds, Handbook of Massive Data Sets. Kluwer Academic, 2002.
6. L. Arge, D. E. Vengroff and J. S. Vitter. External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract). In Proc. 6th European Symposium on Algorithms (1995), LNCS 979, 295-310.
7. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indexes. Acta Informatica, 1(3):173-189, February 1972.
8. M.A. Bender, E. Demaine and M. Farach-Colton Cache-oblivous B-trees. In Proc. 41st IEEE FOCS (2000), pp. 399-409.
9. M. A. Bender, R. Cole and R. Raman. Exponential structures for efficient cache-oblivious algorithms. University of Leicester TR 2002/19, 2002.
10. M. A. Bender, Z. Duan, J. Iacono and J.Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th ACM-SIAM SODA (2002), pp. 29-38.
11. 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. 8th ACM SPAA, pp. 297-308, 1996.
12. G. S. Brodal, R. Fagerberg and R. Jacob. Cache-oblivious search trees via binary trees of small height. In Proc. 13th ACM-SIAM SODA (2002), pp. 39-48.
13. M. R. Brown, R. E. Tarjan. A data structure for representing sorted lists. SIAM J. Comput. 9 (1980), pp. 594-614.
14. M. T. Goodrich, J-J. Tsay, D. E. Vengroff and J. S. Vitter. External-Memory Computational Geometry (Preliminary Version). In Proc. 34th IEEE FOCS (1993), pp. 714-723.
15. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci., 47(3):424-436, 1993.
16. M. Frigo, C. E. Leiserson, H. Prokop and S. Ramachandran Cache-oblivious algorithms. In Proc. 40th IEEE FOCS (1999), pp. 285-298.
17. K. Mehlhorn. Data structures and algorithms, 1. Sorting and searching. Springer, 1984.
18. H. Prokop. Cache-oblivious algorithms. MS Thesis, MIT, 1999.
19. N. Rahman and R. Raman. Adapting radix sort to the memory hierarchy. TR 00-02, King's College London, 2000. Prel. vers. in Proc. ALENEX 2000.
20. N. Rahman, R. Cole and R. Raman. Optimised predecessor data structures for internal memory. In Proc. 5th Workshop on Algorithm Engg., LNCS 2141, pp. 67-78, 2001.
21. N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees. Communications of the ACM 29, 1986, 669-679.
22. M. Thorup. Faster Deterministic Sorting and Priority Queues in Linear Space. Proc. 9th ACM-SIAM SODA (1998), pp. 550-555.
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. J. S. Vitter. External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys 33 (2001) pp. 209-271.
25. 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.