Scanning and traversing: Maintaining data for traversals in a memory hierarchy

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

Volumn 2461, Issue , 2002, Pages 139-150

  Bender, Michael A ^a   Cole, Richard ^b   Demaine, Erik D ^c   Farach Colton, Martin ^d,e  

^a Stony Brook University   (United States)

^b NEW YORK UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d GOOGLE INC   (United States)

^e RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; MEMORY ARCHITECTURE;

BLOCK TRANSFER; CACHE-OBLIVIOUS MODEL; MEMORY HIERARCHY; MEMORY MODELS; MULTI-LEVEL MEMORY HIERARCHY; ORDERED SET; SEQUENTIAL ACCESS;

RANDOM ACCESS STORAGE;

EID: 84938098594     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45749-6_16     Document Type: Conference Paper

References (32)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. CACM, 31(9):1116–1127, Sept. 1988. 140
2. L. Arge, M. A. Bender, E. D. Demaine, B. Holland-Minkley, and J. I. Munro. Cache-oblivious priority queue and graph algorithm applications. In STOC, 2002. 140
3. M. A. Bender, R. Cole, E.D. Demaine, and M. Farach-Colton. Two simplified algorithms for maintaining order in a list. In ESA, 2002. 142
4. M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious search trees. In FOCS, 2000. 140, 141, 142, 147
5. M. A. Bender, E.D. Demaine, and M. Farach-Colton. Efficient tree layout in a multilevel memory hierarchy. In ESA, 2002. 140
6. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In SODA, 2002. 140, 141, 142
7. G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height (extended abstract). In SODA, 2002. 140, 142
8. P. Dietz. Maintaining order in a linked list. In STOC, 1982. 142
9. P. Dietz, J. I. Seiferas, and J. Zhang. At ight lower bound for on-line monotonic list labeling. In SWAT, 1994. 141, 142
10. P. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, 1990. 142
11. P. F. Dietz and D.D. Sleator. Two algorithms for maintaining order in a list. In STOC, 1987. 142
12. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In FOCS, 1998. 141
13. W.R. Franklin. Padded lists: Set operations in expected O(log logN) time. IPL, 9(4):161–166, 1979. 142
14. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS, 1999. 140
15. J. Gray and G. Graefe. The five minute rule ten years later. SIGMOD Record, 26(4), 1997. 140
16. M. Hofri and A.G. Konheim. Padded lists revisited. SICOMP, 16:1073, 1987.142
17. A. Itai, A.G. Konheim, and M. Rodeh. A sparse table implementation of priorityqueues. In S. Even and O. Kariv, editors, ICALP, 1981. 141, 142, 147
18. R. Ladner, J. Fix, and A. LaMarca. Cache performance analysis of algorithms. In SODA, 1999.
19. A. LaMarca and R.E. Ladner. The influence of caches on the performance of sorting. Journal of Algorithms, 31:66–104, 1999.
20. R. Melville and D. Gries. Controlled density sorting. IPL, 10:169–172, 1980. 142
21. D. Patterson and K. Keeton. Hardware technology trends and database opportunities. In SIGMOD, 1998. Keynote address. 140
22. H. Prokop. Cache-oblivious algorithms. Master’s thesis, MIT, 1999. 140
23. V. Raman. Locality preserving dictionaries: theory and application to clustering in databases. In PODS, 1999. 140, 142
24. S. Sen and S. Chatterjee. Towards a theory of cache-efficient algorithms. In SODA, 2000.
25. D.D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2):202–208, 1985.
26. D.D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652–686, July 1985. 141
27. A. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101–112, May 1984. 142
28. J. S. Vitter. External memory algorithms. LNCS, 1461, 1998
29. D. E. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, 1982. 142
30. D. E. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD, 1986. 142
31. D. E. Willard. Ad ensity 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. 141, 142
32. J. Zhang. Density control and on-line labeling problems. Technical Report TR481, University of Rochester, Computer Science Department, Dec. 1993. 142