Abstract
We consider self-organizing data structures in the case where the sequence of accesses can be modeled by a first order Markov chain. For the simple-k- and batched-k-move-to-front schemes, explicit formulae for the expected search costs are derived and compared. We use a new approach that employs the technique of expanding a Markov chain. This approach generalizes the results of Gonnet/Munro/Suwanda. In order to analyze arbitrary memory-free move-forward heuristics for linear lists, we restrict our attention to a special access sequence, thereby reducing the state space of the chain governing the behaviour of the data structure.
In the case of accesses with locality (inert transition behaviour), we find that the hierarchies of self-organizing data structures with respect to the expected search time are reversed, compared with independent accesses. Finally we look at self-organizing binary trees with the move-to-root rule and compare the expected search cost with the entropy of the Markov chain of accesses.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Allen and I. Munro. Self-organizing binary search trees. Journal of the ACM, 25(4):526–535, 1978.
P. J. Burville and J. F. C. Kingman. On a model for storage and search. Journal of Applied Probability, 10:697–701, 1973.
Ph. Chassaing. Optimality of move-to-front for self-organizing data structures with locality of references. Annals of Applied Probability, 3(4):1219–1240, 1993.
F. R. K. Chung, D. J. Hajela, and P. D. Seymour. Self-organizing sequential search and Hilbert's inequalities. In Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pages 217–223, New York, 1985.
G. H. Gonnet, J. I. Munro, and H. Suwanda. Exegesis of self-organizing linear search. SIAM Journal of Computing, 10(3):613–637, 1981.
G. H. Gonnet, and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991.
G. Hotz. Search tress and search graphs for markov sources. Journal of Information Processing and Cybernetics, 29:283–292, 1993.
Y. C. Kan and S. M. Ross. Optimal list order under partial memory constraints. Journal of Applied Probability, 17:1004–1015, 1980.
J. Keilson and A. Kester. Monotone matrices and monotone markov processes. Stochastic Processes and Applications, 5:231–241, 1977.
J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, Princeton, 1960.
J. H. B. Kemperman. The First Passage Problem for a Stationary Markov Chain. University Press, Chicago, 1961.
K. Lam. Comparison of self-organizing linear search. Journal of Applied Probability, 21:763–776, 1984.
K. Lam, M. Y. Leung, and M. K. Siu. Self-organizing files with dependent accesses. Journal of Applied Probability, 21:343–359, 1984.
R. I. Phelps and L. C. Thomas. On optimal performance in self-organizing paging algorithms. Journal Inf. Optimization Science, 1:80–93, 1980.
F. Schulz. Self-organizing data structures with dependent accesses. MSc Thesis supervised by Prof. Dr. G. Hotz, University of Saarbrücken, 1995 (in German). See http://hamster.cs.uni-sb.de/~schulz/
A. M. Tenenbaum and R. M. Nemes. Two spectra of self-organizing sequential search algorithms. SIAM Journal of Computing, 11:557–566, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, F., Schömer, E. (1996). Self-organizing data structures with dependent accesses. 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_156
Download citation
DOI: https://doi.org/10.1007/3-540-61440-0_156
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