Abstract
Self organizing linear search algorithms have been in the literature for over 30 years, and numerous schemes have been proposed during that time. Among all the previous algorithms, the move-to-front rule and the transposition rule are the most extensively analyzed schemes. Recently we proposed and thoroughly analyzed a new scheme, the swap-with-parent rule, which views the list as a heap structure with no ordering constraints between parents and their children [12]. From the analyses of the transposition rule and the swap-with-parent rule, it can be seen that the fundamental property of the corresponding Markov chain being time reversible greatly simplifies the analysis of the algorithm. In this paper, we shall show the existence of a class of time reversible Markov chains resulting from performing swaps on “implicit” trees (called ss_trees) which generalize and extend the results concerning the transposition and the swap-with-parent heuristics.
This paper introduces a generalization of the transposition rule and the swap-with-parent rule — the swap-with-parent-in-an-ss tree heuristic and its modification — the move-to-parent-in-an-sstree heuristic. De tailed expressions for the asymptotic probabilities and the asymptotic search cost of the scheme have been derived.
Partially supported by the National Sciences and Engineering Research Council (NSERC) of Canada
Preview
Unable to display preview. Download preview PDF.
References
J. L. Bentley & C. C. McGeoch (1985). Amortized analyses of self-organizing sequential search heuristics. Proc. 20th Allerton Conference on Comm. Control, and Computing.
J. R. Bitner (1979). Heuristics that dynamically organize data structures. SIAM J. Computing, 8, 1, pp. 82–110.
G. H. Gonnet, J. I. Munro & H. Suwanda (1981). Exegesis of self-organizing linear search. SIAM J. Computing, 10, 3, pp. 613–637.
W. J. Hendricks (1973). An extension of a theorem concerning an interesting Markov chain. J. Appl. Prob. 10, pp886–890.
J. H. Hester & D. S. Hirschberg (1985). Self-organizing linear search. ACM Computing Surveys, pp. 295–311.
Hui & Martel (1993). Unsuccessful seach in self-adjusting data structures. Journal of Algorithms 15, pp.447–481.
Y. C. Kan & S. M. Ross (1980). Optimal list order under partial memory constraints. J. Appl. Prob. 17, pp1004–1015.
F. P. Kelly (1987). Reversibility and Stochastic Networks. John Wiley & Sons, Chichester.
D. E. Knuth (1973). The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, Ma.
J. McCabe (1965). On serial files with relocatable records. Operations Research, 12, pp. 609–618.
B. J. Oommen & J. Dong (1997). On the time reversibility of a well known selforganizing sequential search algorithm. Submitted for Publication.
B. J. Oommen & J. Doug (1997). The swap-with-parent scheme: a self-organizing sequential search algorithm which uses non-lexicographic heaps. Submitted for Publication. Also available as a technical report from the School of Computer Science, Carleton University, Ottawa, Canada: KlS 5B5.
B. J. Oommen & J. Dong (1997). Time Reversibility: A Mathematical Tool for Creating Arbitrary Generalized Swap-with-Parent Self-Organizing Lists. Unabridged version of this paper. Submitted for Publication.
B. J. Oommen & E. R. Hansen (1987). List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations. SIAM J. Computing, 16, pp. 705–716.
B. J. Oommen, E. R. Hansen & J. I. Munro (1990). Deterministic optimal and expedient move-to-rear list organizing strategies. Theoretical Comp. Sci., 74, pp. 183–197.
B. J. Oommen & D. T. H. Ng (1993). An optimal absorbing list organization strategy with constant memory requirements. Theoretical Comp. Sci., 119, pp. 355–361.
R. L. Rivest (1976). On self-organizing sequential search heuristics. Comm. ACM, 19, pp. 63–67.
S. M. Ross (1980). Introduction to Probability Models, 2nd edition. Academic Press, London.
Sleator & Tarjan (1985). Amortized efficiency of list update and paging rules. Comm.A.C.M. 28(2), pp. 202–208.
A. M. Tenenbaum & R. M. Nemes (1982). Two spectra of self-organizing sequential search algorithms. SIAM J. Computing, 11, pp. 557–566
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Oommen, J., Dong, J. (1997). Generalized swap-with-parent schemes for self-organizing sequential linear lists. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive