Advertisement

Lists on Lists: A Framework for Self-organizing Lists in Environments with Locality of Reference

  • Abdelrahman Amer
  • B. John Oommen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4007)

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.

Keywords

Search Cost Learn Automaton Zipf Distribution Dependent Environment Periodic Environment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    McCabe, J.: On serial files with relocatable records. Operations Research 12, 609–618 (1965)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Bitner, J.R.: Heuristics that dynamically organize data structures. SIAM Journal on Computing 8(1), 82–110 (1979)CrossRefMathSciNetMATHGoogle Scholar
  3. 3.
    Rivest, R.: On self-organizing sequential search heuristics. Communications of the ACM 19(2), 63–67 (1976)CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    Tenenbaum, A.M., Nemes, R.M.: Two spectra of self-organizing sequential search algorithms. SIAM Journal on Computing 11, 557–566 (1982)CrossRefMathSciNetMATHGoogle Scholar
  5. 5.
    Kan, Y.C., Ross, S.M.: Optimal list order under partial memory constraints. Journal of Applied Probability 17, 1004–1015 (1980)CrossRefMathSciNetMATHGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Bachrach, R., El-Yaniv, R., Reinstadtler, M.: On the competitive theory and practice of online list accessing algorithms. Algorithmica 32(2), 201–245 (2002)CrossRefMathSciNetMATHGoogle Scholar
  8. 8.
    Irani, S.: Two results on the list update problem. Information Processing Letters 38(6), 301–306 (1991)CrossRefMathSciNetMATHGoogle Scholar
  9. 9.
    Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive algorithms for the list update problem. Algorithmica 11(1), 15–32 (1994)CrossRefMathSciNetMATHGoogle Scholar
  10. 10.
    Albers, S.: Improved randomized on-line algorithms for the list update problem. SIAM Journal on Computing 27, 670–681 (1998)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Lam, K., Leung, M.Y., Siu, M.K.: Self-organizing files with dependent accesses. Journal of Applied Probability 21, 343–359 (1984)CrossRefMathSciNetMATHGoogle Scholar
  12. 12.
    Chassaing, P.: Optimality of move-to-front for self-organizing data structures. Annals of Applied Probability 3(4), 1219–1240 (1993)CrossRefMathSciNetMATHGoogle Scholar
  13. 13.
    Oommen, B.J., Ma, D.C.Y.: Deterministic learning automata solutions to the equipartitioning problem. IEEE Transactions on Computers 37(1) (1988)Google Scholar
  14. 14.
    Oommen, B.J., Ma, D.C.Y.: Stochastic automata solutions to the object partioning problem. The Computer Journal 35, 105 (1992)Google Scholar
  15. 15.
    Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Abdelrahman Amer
    • 1
  • B. John Oommen
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations