Two Simplified Algorithms for Maintaining Order in a List
In the Order-Maintenance Problem, the objective is to maintain a total order subject to insertions, deletions, and precedence queries. Known optimal solutions, due to Dietz and Sleator, are complicated. We present new algorithms that match the bounds of Dietz and Sleator. Our solutions are simple, and we present experimental evidence that suggests that they are superior in practice.
KeywordsTotal Order Weight Cost List Element Virtual Tree Order Maintenance
Unable to display preview. Download preview PDF.
- L. Arge and J. Vitter. Optimal dynamic interval management in external memory. In FOCS, 1996.Google Scholar
- P. Dietz and D. Sleator. Two algorithms for maintaining order in a list. In STOC, 1987.Google Scholar
- P. F. Dietz. Maintaining order in a linked list. In STOC, 1982.Google Scholar
- P. F. Dietz, J. I. Seiferas, and J. Zhang. A tight lower bound for on-line monotonic list labeling. In SWAT, 1994.Google Scholar
- P. F. Dietz and J. Zhang. Lower bounds for monotonic list labeling. In SWAT, 1990.Google Scholar
- A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In ICALP, 1981.Google Scholar
- W. Pugh. Skip lists: a probabilistic alternative to balanced trees. In WADS, 1989.Google Scholar
- D. Willard. Inserting and deleting records in blocked sequential files. Technical Report TM81-45193-5, Bell Laboratories, 1981.Google Scholar
- D. Willard. Maintaining dense sequential files in a dynamic environment. In STOC, 1982.Google Scholar
- D. Willard. Good worst-case algorithms for inserting and deleting records in dense sequential files. In SIGMOD, 1986.Google Scholar