Abstract
We study the problem of maintaining a dynamic ordered set subject to insertions, deletions, and traversals of k consecutive elements. This problem is trivially solved on a RAM and on a simple two-level memory hierarchy. We explore this traversal problem on more realistic memory models: the cache-oblivious model, which applies to unknown and multi-level memory hierarchies, and sequential-access models, where sequential block transfers are less expensive than random block transfers.
Supported in part by HRL Laboratories, NSF Grant EIA-0112849, and Sandia National Laboratories.
Supported in part by NSF Grants CCR-9800085 and CCR-0105678.
Supported in part by NSF Grant EIA-0112849.
Supported in part by NSF Grant CCR-9820879.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. CACM, 31(9):1116–1127, Sept. 1988.
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.
M. A. Bender, R. Cole, E.D. Demaine, and M. Farach-Colton. Two simplified algorithms for maintaining order in a list. In ESA, 2002.
M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious search trees. In FOCS, 2000.
M. A. Bender, E.D. Demaine, and M. Farach-Colton. Efficient tree layout in a multilevel memory hierarchy. In ESA, 2002.
M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cacheoblivious dynamic dictionary. In SODA, 2002.
G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height (extended abstract). In SODA, 2002.
P. Dietz. Maintaining order in a linked list. In STOC, 1982.
P. Dietz, J. I. Seiferas, and J. Zhang. At ight lower bound for on-line monotonic list labeling. In SWAT, 1994.
P. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, 1990.
P. F. Dietz and D.D. Sleator. Two algorithms for maintaining order in a list00. In STOC, 1987.
M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In FOCS, 1998.
W.R. Franklin. Padded lists: Set operations in expected O(log logN) time. IPL, 9(4):161–166, 1979.
M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS, 1999.
J. Gray and G. Graefe. The five minute rule ten years later. SIGMOD Record, 26(4), 1997.
M. Hofri and A.G. Konheim. Padded lists revisited. SICOMP, 16:1073, 1987.
A. Itai, A.G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In S. Even and O. Kariv, editors, ICALP, 1981.
R. Ladner, J. Fix, and A. LaMarca. Cache performance analysis of algorithms. In SODA, 1999.
A. LaMarca and R.E. Ladner. The influence of caches on the performance of sorting. Journal of Algorithms, 31:66–104, 1999.
R. Melville and D. Gries. Controlled density sorting. IPL, 10:169–172, 1980.
D. Patterson and K. Keeton. Hardware technology trends and database opportunities. In SIGMOD, 1998. Keynote address.
H. Prokop. Cache-oblivious algorithms. Master’s thesis, MIT, 1999.
V. Raman. Locality preserving dictionaries: theory and application to clustering in databases. In PODS, 1999.
S. Sen and S. Chatterjee. Towards a theory of cache-efficient algorithms. In SODA, 2000.
D.D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. CACM, 28(2):202–208, 1985.
D.D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652–686, July 1985.
A. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica, 21(1):101–112, May 1984.
J. S. Vitter. External memory algorithms. LNCS, 1461, 1998.
D. E. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, 1982.
D. E. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD, 1986.
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.
J. Zhang. Density control and on-line labeling problems. Technical Report TR481, University of Rochester, Computer Science Department, Dec. 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, 4. (2002). Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. In: Möhring, R., Raman, R. (eds) Algorithms — ESA 2002. ESA 2002. Lecture Notes in Computer Science, vol 2461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45749-6_16
Download citation
DOI: https://doi.org/10.1007/3-540-45749-6_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44180-9
Online ISBN: 978-3-540-45749-7
eBook Packages: Springer Book Archive