Skip to main content
SpringerLink
Log in

Key Independent Optimality

  • Conference paper
  • First Online:
Book cover Algorithms and Computation (ISAAC 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2518))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Cole. On the dynamic finger conjecture for splay trees. part II: The proof. SIAM J. Comp., 30(1):44–85,2000.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. M.L. Fredman, 2001. Private Communication.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. J. Iacono. New upper bounds for pairing heaps. In Scandinavian Workshop on Algorithm Theory (LNCS 1851), pages 32–45, 2000.

    Google Scholar 

  7. J. Iacono. Alternatives to splay trees with o(logn)worst-case access times. In Symposium on Discrete Algorithms, pages 516–522, 2001.

    Google Scholar 

  8. J. Iacono. Distribution Sensitive Data Structures. PhD thesis, Rutgers, The State University of New Jersey, Graduate School, New Brunswick, 2001

    Google Scholar 

  9. D.E. Knuth Optimum binary search trees. Acta inf., 1:14–25, 1971

    Article  MATH  Google Scholar 

  10. D.D. Sleator and R.E. Tarjan. Self-adjusting binary trees. JACM, 32:652–686, 1985

    Article  MATH  MathSciNet  Google Scholar 

  11. R. Wilbur. Lower bounds for accessing binary search trees with rotation. In Proc. 27th Symp. on foundation of Computer Science, pages 61–69, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Polytechnic University, 5 MetroTech Center, Brooklyn, NY, 11201, USA

    John Iacono

Authors
  1. John Iacono
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario, Canada, K1S 5B6

    Prosenjit Bose  & Pat Morin  & 

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation