Abstract
We examine the problem of self-organizing linear search lists in environments with the locality of reference phenomenon, when the queries exhibit a probabilistic dependence between themselves. We introduce a novel list organization framework that we call Lists on Lists (LOL), which regards the list as a set of sublists that are manageable in the same way that individual records are. A LOL organization involves a reorganization operation on the accessed record level, as well as another on the sublist which it belongs to (the record’s context). We show that it is beneficial to consider the reorganization of the context together with the accessed record, since other records within the context are likely to be accessed in the near future. With the aid of an automaton-based partitioning algorithm, we demonstrate that we can accurately classify the different contexts of the sublist. Using this framework, we were able to empirically achieve asymptotic search costs that are significantly superior to the move-to-front heuristic, widely acknowledged as the best algorithm for such environments.
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
McCabe, J.: On serial files with relocatable records. Operations Research 12, 609–618 (1965)
Bitner, J.R.: Heuristics that dynamically organize data structures. SIAM Journal on Computing 8(1), 82–110 (1979)
Rivest, R.: On self-organizing sequential search heuristics. Communications of the ACM 19(2), 63–67 (1976)
Tenenbaum, A.M., Nemes, R.M.: Two spectra of self-organizing sequential search algorithms. SIAM Journal on Computing 11, 557–566 (1982)
Kan, Y.C., Ross, S.M.: Optimal list order under partial memory constraints. Journal of Applied Probability 17, 1004–1015 (1980)
Schulz, F.: Two new families of list update algorithms. In: Chwa, K.-Y., H. Ibarra, O. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 99–108. Springer, Heidelberg (1998)
Bachrach, R., El-Yaniv, R., Reinstadtler, M.: On the competitive theory and practice of online list accessing algorithms. Algorithmica 32(2), 201–245 (2002)
Irani, S.: Two results on the list update problem. Information Processing Letters 38(6), 301–306 (1991)
Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive algorithms for the list update problem. Algorithmica 11(1), 15–32 (1994)
Albers, S.: Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing 27, 670–681 (1998)
Lam, K., Leung, M.Y., Siu, M.K.: Self-organizing files with dependent accesses. Journal of Applied Probability 21, 343–359 (1984)
Chassaing, P.: Optimality of move-to-front for self-organizing data structures. Annals of Applied Probability 3(4), 1219–1240 (1993)
Oommen, B.J., Ma, D.C.Y.: Deterministic learning automata solutions to the equipartitioning problem. IEEE Transactions on Computers 37(1) (1988)
Oommen, B.J., Ma, D.C.Y.: Stochastic automata solutions to the object partioning problem. The Computer Journal 35, 105 (1992)
Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amer, A., Oommen, B.J. (2006). Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_10
Download citation
DOI: https://doi.org/10.1007/11764298_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34597-8
Online ISBN: 978-3-540-34598-5
eBook Packages: Computer ScienceComputer Science (R0)