Article

Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy

Authors:

Michael A. Bender,

Erik D. Demaine,

Martin Farach-ColtonAuthors Info & Claims

ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms

Pages 139 - 151

Published: 17 September 2002 Publication History

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.

References

[1]

A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. CACM , 31(9):1116-1127, Sept. 1988.

[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.

[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.

[4]

M. A. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious search trees. In FOCS , 2000.

[5]

M. A. Bender, E. D. Demaine, and M. Farach-Colton. Efficient tree layout in a multilevel memory hierarchy. In ESA , 2002.

[6]

M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In SODA , 2002.

[7]

G. S. Brodal, R. Fagerberg, and R. Jacob. Cache oblivious search trees via binary trees of small height (extended abstract). In SODA , 2002.

[8]

P. Dietz. Maintaining order in a linked list. In STOC , 1982.

[9]

P. Dietz, J. I. Seiferas, and J. Zhang. At ight lower bound for on-line monotonic list labeling. In SWAT , 1994.

[10]

P. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT , 1990.

[11]

P. F. Dietz and D.D. Sleator. Two algorithms for maintaining order in a list. In STOC , 1987.

[12]

M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. Overcoming the memory bottleneck in suffix tree construction. In FOCS , 1998.

[13]

W.R. Franklin. Padded lists: Set operations in expected O (log log N ) time. IPL , 9(4):161-166, 1979.

[14]

M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In FOCS , 1999.

[15]

J. Gray and G. Graefe. The five minute rule ten years later. SIGMOD Record , 26(4), 1997.

[16]

M. Hofri and A.G. Konheim. Padded lists revisited. SICOMP , 16:1073, 1987.

[17]

A. Itai, A.G. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In S. Even and O. Kariv, editors, ICALP , 1981.

[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.

[21]

D. Patterson and K. Keeton. Hardware technology trends and database opportunities. In SIGMOD , 1998. Keynote address.

[22]

H. Prokop. Cache-oblivious algorithms. Master's thesis, MIT, 1999.

[23]

V. Raman. Locality preserving dictionaries: theory and application to clustering in databases. In PODS , 1999.

[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.

[27]

A. Tsakalidis. Maintaining order in a generalized linked list. Acta Informatica , 21(1):101-112, May 1984.

[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.

[30]

D. E. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD , 1986.

[31]

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, Apr. 1992.

[32]

J. Zhang. Density control and on-line labeling problems. Technical Report TR481, University of Rochester, Computer Science Department, Dec. 1993.

Cited By

Zhan YConway AJiao YMukherjee NGroombridge IBender MFarach-Colton MJannen WJohnson RPorter DYuan J(2021)Copy-on-Abundant-Write for Nimble File System ClonesACM Transactions on Storage10.1145/342349517:1(1-27)Online publication date: 29-Jan-2021
https://dl.acm.org/doi/10.1145/3423495
Zhan YConway AJiao YKnorr EBender MFarach-Colton MJannen WJohnson RPorter DYuan JAgrawal NRangaswami R(2018)The full path to full-path indexingProceedings of the 16th USENIX Conference on File and Storage Technologies10.5555/3189759.3189771(123-138)Online publication date: 12-Feb-2018
https://dl.acm.org/doi/10.5555/3189759.3189771
Zhan YJiao YPorter DConway AKnorr EFarach-Colton MBender MYuan JJannen WJohnson R(2018)Efficient Directory Mutations in a Full-Path-Indexed File SystemACM Transactions on Storage10.1145/324106114:3(1-27)Online publication date: 26-Nov-2018
https://dl.acm.org/doi/10.1145/3241061
Show More Cited By

Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis

Recommendations

Traversing binary tree structures with shift register memories (Recent Results)

The paper proposes a tree-structured shift register memory in which traversals of binary data tress in pre-or end-order are performed as sequences of two non-cyclic data permutations which move the data tree relative to a unique access port that is ...
Traversing Binary Tree Structures with Shift-Register Memories

The paper proposes a tree-structured shift-register memory which employs two different data permutation operations to perform pre-/post-order traversals of binary tree structures.
Traversing binary tree structures with shift register memories (Recent Results)
ISCA '76: Proceedings of the 3rd annual symposium on Computer architecture

The paper proposes a tree-structured shift register memory in which traversals of binary data tress in pre-or end-order are performed as sequences of two non-cyclic data permutations which move the data tree relative to a unique access port that is ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms

September 2002

925 pages

ISBN:3540441808

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 17 September 2002

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhan YConway AJiao YMukherjee NGroombridge IBender MFarach-Colton MJannen WJohnson RPorter DYuan J(2021)Copy-on-Abundant-Write for Nimble File System ClonesACM Transactions on Storage10.1145/342349517:1(1-27)Online publication date: 29-Jan-2021
https://dl.acm.org/doi/10.1145/3423495
Zhan YConway AJiao YKnorr EBender MFarach-Colton MJannen WJohnson RPorter DYuan JAgrawal NRangaswami R(2018)The full path to full-path indexingProceedings of the 16th USENIX Conference on File and Storage Technologies10.5555/3189759.3189771(123-138)Online publication date: 12-Feb-2018
https://dl.acm.org/doi/10.5555/3189759.3189771
Zhan YJiao YPorter DConway AKnorr EFarach-Colton MBender MYuan JJannen WJohnson R(2018)Efficient Directory Mutations in a Full-Path-Indexed File SystemACM Transactions on Storage10.1145/324106114:3(1-27)Online publication date: 26-Nov-2018
https://dl.acm.org/doi/10.1145/3241061
Bender MFineman JGilbert SKopelowitz TMontes PKlein P(2017)File maintenanceProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039784(1503-1522)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039784
Bender MFarach-Colton MFekete SFineman JGilbert S(2017)Cost-Oblivious Storage ReallocationACM Transactions on Algorithms10.1145/307069313:3(1-20)Online publication date: 26-May-2017
https://dl.acm.org/doi/10.1145/3070693
Bender MFarach-Colton MFekete SFineman JGilbert SHull RGrohe M(2014)Cost-oblivious storage reallocationProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/2594538.2594548(278-288)Online publication date: 18-Jun-2014
https://dl.acm.org/doi/10.1145/2594538.2594548
Prat-Pérez ADominguez-Sal DLarriba-Pey J(2011)Social based layouts for the increase of locality in graph operationsProceedings of the 16th international conference on Database systems for advanced applications - Volume Part I10.5555/1997305.1997356(558-569)Online publication date: 22-Apr-2011
https://dl.acm.org/doi/10.5555/1997305.1997356
Frias LPetit JRoura S(2010)Lists revisitedACM Journal of Experimental Algorithmics10.1145/1498698.156450514(3.5-3.27)Online publication date: 5-Jan-2010
https://dl.acm.org/doi/10.1145/1498698.1564505
Brodal GFagerberg RVinther K(2008)Engineering a cache-oblivious sorting algorithmACM Journal of Experimental Algorithmics10.1145/1227161.122716412(1-23)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1227161.1227164
Bender MHu H(2007)An adaptive packed-memory arrayACM Transactions on Database Systems10.1145/1292609.129261632:4(26-es)Online publication date: 1-Nov-2007
https://dl.acm.org/doi/10.1145/1292609.1292616
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents