SELF-ORGANIZING FILES WITH DEPENDENT ACCESSES

We analyze certain self-organizing filing techniques when accesses are assumed to be dependent on each other. The stream of requests for accessing records in a file is modelled as a Markov chain. A general framework is introduced to obtain the asymptotic search cost of a memory-free selforganizing heuristic. The move-to-front heuristic is studied in detail. A formula for the asymptotic search cost, which generalizes that in the case of independent accesses, is obtained. Numerical examples on the performance of the transposition heuristic are provided, and compared with that of the move-to-front

[1]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[2]  S. M. Ross,et al.  Optimal list order under partial memory constraints , 1980, Journal of Applied Probability.

[3]  Kai Lai Chung,et al.  Markov Chains with Stationary Transition Probabilities , 1961 .

[4]  W. J. Hendricks.  The stationary distribution of an interesting Markov chain , 1972, Journal of Applied Probability.

[5]  John McCabe,et al.  On Serial Files with Relocatable Records , 1965 .

[6]  R. Weber,et al.  A counterexample to a conjecture on optimal list ordering , 1982 .

[7]  P. J. Burville,et al.  On a model for storage and search , 1973, Journal of Applied Probability.

[8]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[9]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[10]  Lyn C. Thomas,et al.  On optimal performance in self-organizing paging algorithms , 1980, Acta Cybern..

[12]  W. J. Hendricks.  An Account of Self-Organizing Systems , 1976, SIAM J. Comput..

[13]  Yaakov L. Varol,et al.  A Note on Heuristics for Dynamic Organization of Data Structures , 1981, Inf. Process. Lett..

[14]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

[15]  Clement T. Yu,et al.  A Generalized Counter Scheme , 1981, Theor. Comput. Sci..

[16]  T. E. Harris.  First passage and recurrence distributions , 1952 .

[17]  Gaston H. Gonnet,et al.  Exegesis of Self-Organizing Linear Search , 1981, SIAM J. Comput..

[18]  James R. Bitner,et al.  Heuristics That Dynamically Organize Data Structures , 1979, SIAM J. Comput..