Abstract
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.
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
M.R. Brown and R.E. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM J. Comput.,9:594–614, 1980.
R. Cole. On the dynamic finger conjecture for splay trees. part II: The proof. SIAM J. Comp., 30(1):44–85,2000.
R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. part I: Splay sorting log n-block sequences. SIAM J. Comp., 30(1):1–43, 2000.
M.L. Fredman, 2001. Private Communication.
L.J. Guibas, E.M. McCreight, M.F. Plass, and J.R. Roberts. A new representation for linear lists. In Proc. 9th Ann. ACM Symp. on Theory of Computing, pages 49–60, 1977.
J. Iacono. New upper bounds for pairing heaps. In Scandinavian Workshop on Algorithm Theory (LNCS 1851), pages 32–45, 2000.
J. Iacono. Alternatives to splay trees with o(logn)worst-case access times. In Symposium on Discrete Algorithms, pages 516–522, 2001.
J. Iacono. Distribution Sensitive Data Structures. PhD thesis, Rutgers, The State University of New Jersey, Graduate School, New Brunswick, 2001
D.E. Knuth Optimum binary search trees. Acta inf., 1:14–25, 1971
D.D. Sleator and R.E. Tarjan. Self-adjusting binary trees. JACM, 32:652–686, 1985
R. Wilbur. Lower bounds for accessing binary search trees with rotation. In Proc. 27th Symp. on foundation of Computer Science, pages 61–69, 1986
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iacono, J. (2002). Key Independent Optimality. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_3
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive