Abstract
We consider the online list accessing problem and present a new family of competitive-optimal deterministic list update algorithms which is the largest class of such algorithms known to-date. This family, called Sort-by-Rank (sbr), is parametrized with a real 0 ≤ α ≤1, where sbr(0) is the Move-to-Front algorithm and sbr (1)is equivaent to the Timestamp algorithm. The behaviour of sbr(α)mediates between the eager strategy of Move-to-Front and the more conservative behaviour of Timestamp.
We also present a family of algorithms Sort-by-Delay (sbd) which is parametrized by the positive integers, where sbd (1)is Move-to-Front and sbd (2)is equiva ent to Timestamp In general, sbd (κ)is κ - competitive for κ>2. This is the first class of algorithms that is asymptotically optima for independent, identically distributed requests while each algorithm is constant-competitive.
Empirical studies with with both generated and real-world data are also included.
supported by a Graduiertenkolleg fellowship from the Deutsche Forschungsgemein-schaft (DFG), Germany.
This is a preview of subscription content, log in via an institution to check access.
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
S. Albers and M. Mitzenmacher. Average case analyses of list update algorithms. In ICALP’96, LNCS 1099, pages 514–525. Springer, 1996.
S. Albers. Improved randomized on-line a gorithms for the list update problem. In SODA’95, pages 412–419, 1995.
Ran Bachrach and Ran El-Yaniv. Online list accessing a gorithms and their applications: Recent empirical evidence. In SODA’97, pages 53–62, 1997.
J.L. Bentley and C.C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communications of the ACM, 28(4):404–411, 1985.
J.L. Bentley, D. Sleator, R.E. Tarjan, and V. Wei. A ocally adaptive data compression scheme. Communications of the ACM, 29:320–330, 1986.
M. Burrows and D.J. Wheeler. A block-sorting ossless data compression algorithm. Technical report 124, DEC Systems Research Center, May 1994.
F.R.K. Chung, D.J. Hajela, and P.D. Seymour. Self-organizing sequential search and Hilbert’s inequalities. In Proc. 17th ACM STOC, pages 217–223, 1985.
Ran El Yaniv. There are infinitely many competitive-optima online ist accessing algorithms. Manuscript, 1997.
M.J. Golin. A provably fast inear-expected-time maxima-finding algorithm. Algorithmica 11:501–524, 1994.
G.H. Gonnet, J.I. Munro, and H. Suwanda. Exegesis of self-organizing linear search. SIAM Journal of Computing, 10(3):613–637, 1981.
K. Lam, M.Y. Leung, and M.K. Siu. Self-organizing files with dependent accesses. Journal of Applied Probability 21:343–359, 1984.
J. McCabe. On serial files with relocatable records. Oper. Res., 12:609–618, 1965.
F. Schulz and E. Schömer. Self-organizing data structures with dependent accesses. In ICALP’96, LNCS 1099, pages 526–537. Springer, 1996.
D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202–208, 1985.
I.H. Witten and T. Bell. The calgary text compression corpus. Anonymous ftp from ftp://cpsc.ucalgary.ca:/pub/projects/text.compression.corpus/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, F. (1998). Two New Families of List Update Algorithms. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-49381-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65385-1
Online ISBN: 978-3-540-49381-5
eBook Packages: Springer Book Archive