Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1989: Algorithms and Data Structures pp 541–551Cite as

A new search time update time tradeoff for the implicit dictionary

  • Conference paper
  • First Online:

  • 682 Accesses

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

Abstract

We show that the product of the search time with the update time must be in Ω(log3/2 n) for any implicit dictionary of size n.

Supported by NSERC.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. M. Adel'son-Vel'skii and Y. M. Landis, An algorithm for the Organization of Information, Dokl. Akad. Nauk UzSSR, Vol. 146, pages 263–266 (in Russian). English translation in Soviet Math. Dokl., Vol.3, 1962, pages 1259–1262.

    Google Scholar 

  2. A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem, Theoretical Computer Science, Vol. 58, 1988, pages 57–68.

    Article  Google Scholar 

  3. R. Bayer, E. McCreight, Organization and Maintenance of Large Ordered Indexes, Acta Informatica, Vol. 1, pages 290–306.

    Google Scholar 

  4. P. Derome, A Tradeoff Between the Search Time and the Update Time for the Implicit Dictionary, University of Toronto, Technical Report.

    Google Scholar 

  5. A. Fiat, M. Naor, A. A. Schäffer, J. P. Schmidt, and A. Siegel, Storing and Searching a Multikey Table, 20th Annual ACM Symposium on Theory of Computing, 1988, pages 344–351.

    Google Scholar 

  6. G. N. Frederickson, Implicit Data Structures For the Dictionary Problem, J. ACM, Vol. 30 No. 1, 1984, pages 80–94.

    Article  Google Scholar 

  7. D. Harel, Fast Updates of Balanced Trees with a Guaranteed Time Bound per Update, University of California, Irvine, Technical Report #154, August 1980.

    Google Scholar 

  8. J. I. Munro, An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(log2 n) Time, Journal of Computer System Sciences, Vol. 33, 1986, pages 66–74.

    Google Scholar 

  9. J. I. Munro, and H. Suwanda, Implicit Data Structures for Fast Search and Update, Journal of Computer System Sciences, Vol. 21, 1980, pages 236–250.

    Google Scholar 

  10. J. W. J. Williams, Algorithm 232: Heapsort, Communications of the ACM, Vol. 7 No. 6, pages 347–348.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Canada

    Philippe Derome

Authors
  1. Philippe Derome
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derome, P. (1989). A new search time update time tradeoff for the implicit dictionary. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_45

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

  • Online ISBN: 978-3-540-48237-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation