Abstract
We study the performance of the Timestamp(O) (TS(O)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(O) is better than Move-to-front on such sources, and determine performance ratios for TS(O) against the optimal offline and static adversaries in this situation. Previous work on such sources compared online algorithms only to static adversaries. One practical motivation for our work is the use of the Move-to-front heuristic in various compression algorithms. Our theoretical results suggest that in many cases using TS(O) in place of Move-to-front in schemes that use the latter should improve compression. Tests on a standard corpus of documents demonstrate that TS(O) leads in fact to improved compression.
Part of this work was done while the author was at the International Computer Science Institute, Berkeley
This work was supported in part by the Office of Naval Research and in part by NSF Grant CCR-9505448
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Albers. Improved randomized on-line algorithms for the list update problem. In Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412–419, 1995.
J.L. Bentley and C.C. McGeoch. Amortized analyses of self-organizing sequential search heuristics. Communication of the ACM, 28:404–411, 1985.
J.L. Bentley, D.S. Sleator, R.E. Tarjan and V.K. Wei. A locally adaptive data compression scheme. Communication of the ACM, 29:320–330, 1986.
M. Burrows and D.J. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report 124, 1994.
F.R.K. Chung, D.J. Hajela and P.D. Seymour. Self-organizing sequential search and Hubert's inequality. Proc. 17th Annual Symposium on the Theory of Computing, pages 217–223, 1985.
P. Elias. Universal codeword sets and the representation of the integers. IEEE Transactions on Information Theory, 21:194–203, 1975.
G.H. Gonnet, J.I. Munro and H. Suwanda. Towards self-organizing linear search. In Proc. 19th Annual IEEE Symposium on Foundations of Computer Science, pages 169–174, 1979.
D. Grinberg, S. Rajagopalan, R. Venkatesan and V.K. Wei. Splay trees for data compression. In Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 522–530, 1995.
G.H. Hardy, J.E. Littlewood and G. Polya. Inequalities. Cambridge University Press, Cambridge, England, 1967.
S. Irani. Two results on the list update problem. Information Processing Letters, 38:301–306, 1991.
R. Karp and P. Raghavan. From a personal communication cited in [13].
R. Rivest. On self-organizing sequential search heuristics. Communication of the ACM, 19:63–67, 1976.
N. Reingold, J. Westbrook and D.D. Sleator. Randomized competitive algorithms for the list update problem. Algorithmica, 11(1):15–32, 1994.
D.D. Sleator and R.E. Tarjan. Amortized efficiency of list update and paging rules. Communication of the ACM, 28:202–208, 1985.
B. Teia. A lower bound for randomized list update algorithms. Information Processing Letters, 47:5–9, 1993.
I.H. Witten and T. Bell. The Calgary/Canterbury text compression corpus. Anonymous ftp from ftp.cpsc.ucalgary.ca: /pub/text.compression/corpus/ text.compression.corpus.tar.Z.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albers, S., Mitzenmacher, M. (1996). Average case analyses of list update algorithms, with applications to data compression. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_155
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_155
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61440-1
Online ISBN: 978-3-540-68580-7
eBook Packages: Springer Book Archive