Abstract
For storage and retrieval applications where access frequencies are biased, uniformly-balanced search trees may be suboptimal. Splay trees address this issue, providing a means for searching which is statically optimum and conjectured to be dynamically optimum. Subramanian explored the reasons for their success, expressing local transformations as templates and giving sufficient criteria for a template family to exhibit amortized O(logN) performance. We present a different formulation of the potential function, based on progress factors along edges. Its decomposition w.r.t. a template enables us to relax all of Subramanian’s conditions. Moreover it illustrates the reasons why template-based self-adjustment schemes work, and provides a straightforward way of evaluating the efficiency of such schemes.
This work was supported in part by grant TACIT 312304 at the Foundation of Reasearch and Technology, Hellas (FORTH).
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
Allen, B., Munro, J. I., “Self Organizing Binary Search Trees”, J. of the A.C.M. 25(4) (1978), 526–535.
Adel’son-Vel’ski, G. M., Landis, E. M., “An Algorithm for the Organization of Information”, Soviet Mathematics Doklady 3 (1962), 1259–1263.
Bayer, R., McCreight, E., “Organization and Maintenance of Large Ordered Indices”, Acta Informatica 1(3) (1972), 173–189.
Balasubramanian, R., Raman, V., “Path Balance Heuristic for Self-Adjusting Binary Search Trees”, Foundations of Software Technology and Theoretical Computer Science 15 (1995), 338–348.
Bent, S. W., Sleator, D. D., Tarjan, R. E., “Biased Search Trees”, J. on Computing 14(3) (1985), 545–568.
Grinberg, D., Rajagopalan, S., Venkatesan, R., Wei, V. K., “Splay Trees for Data Compression”, Proc. 6th Symp. on Discrete Algorithms (1995), 522–530.
Hu, T. C., Tucher, A. C., “Optimal Computer Search Trees and Variable-Length Alphabetic Codes”, J. of Applied Mathematics 21(4) (1971), 514–532.
Knuth, D. E., “Optimum Binary Search Trees”, Acta Informatica 1(1) (1971), 14–25.
Overmars, M. H., “The Design of Dynamic Data Structures”, Lecture Notes on Computer Science 156, Springer Verlag, 1983.
Sherk, M., “Self Adjusting k-ary Search Trees”, J. of Algorithms 19(1) (1995), 25–44.
Sleator, D. D., Tarjan, R. E., “Self Adjusting Binary Search Trees”, J. of the A.C.M. 32(3) (1985), 652–686.
Sleator, D. D., Tarjan, R. E., “Amortized Efficiency of List Updates and Paging Rules”, C. of the A.C.M. 28(2) (1985), 202–208.
Subramanian, A., “An Explanation of Splaying”, J. of Algorithms 20(3) (1996), 512–525.
Sundar, R., “Twists, Turns, Cascades, Dequeue Conjecture and Scanning Theorem”, 30th FOCS (1989), 555–559.
Tarjan, R. E., “Amortized Computational Complexity”, J. of Applied and Discrete Mathematics 6(2) (1985), 306–318.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georgakopoulos, G.F., McClurkin, D.J. (1999). General Splay: A Basic Theory and Calculus. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive