Skip to main content
SpringerLink
Log in

Dynamic interpolation search

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

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

Included in the following conference series:

Abstract

We present a new data structure called Interpolation Search tree (IST) which supports interpolation search and insertions and deletions. Amortized insertion and deletion cost is O(log n). The expected search time in a random file is O(log log n). This is not only true for the uniform distribution but for a wide class of probability distributions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Frederickson: “Implicit Data Structures for the Dictionary problem“ Journal of ACM Vol. 30 No. 1, 80–94 (1983)

    Article  Google Scholar 

  2. G. Gonnet, L. Rogers, J. George: “An Algorithmic and Complexity Analysis of Interpolation Search“ Acta Informatica 13(1), 39–52 (1980)

    Article  Google Scholar 

  3. A. Itai, A.G. Konheim, M. Rodeh: “A Sparse Table Implementation of Priority Queues“ Proc. ICALP 81, LNCS 115, 417–431 (1981)

    Google Scholar 

  4. D. E. Knuth: “Deletions that preserve Randomness“ IEEE Trans.Software Engrg. SE 3, 351–359

    Google Scholar 

  5. K. Mehlhorn: “Data Structures and Algorithms“ Vol. 1, Sorting and Searching, Springer Verlag, EATCS Monographs in Theoretical Computer Science 1980

    Google Scholar 

  6. K. Mehlhorn and A. Tsakalidis: “Dynamic Interpolation Search“ Technischer Bericht A84/05 FB 10 Universität des Saarlandes, 1984, submitted to Journal of ACM.

    Google Scholar 

  7. Y. Pearl, A. Itai, H. Avni: “Interpolation Search-A Log Log N Search“ Communications of ACM, 21(7), 550–554 (1978)

    Article  Google Scholar 

  8. Y Pearl and E. M. Reingold: “Understanding the Complexity of Interpolation Search“ Inform Proc. Letters 6(6), 219–222 (1977)

    Article  Google Scholar 

  9. W.W. Peterson: “Addressing for Random Storage“ IBM J. Res. and Develop. 1, 131–132 (1957)

    Google Scholar 

  10. D.E. Willard: “Searching Nonuniformly Generated Files in a Log Log N Runtime“ SIAM Journal of Computing, in press

    Google Scholar 

  11. A.C. Yao and F.F. Yao: “The Complexity of Searching an Ordered Random Table“ Proc. 17th Annual Symp. Foundations of Computer Science 173–177 (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 10, Angewandte Mathematik und Informatik Universität des Saarlandes, D-6600, Saarbrücken, West Germany

    Kurt Mehlhorn & Athanasios Tsakalidis

Authors
  1. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Athanasios Tsakalidis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mehlhorn, K., Tsakalidis, A. (1985). Dynamic interpolation search. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015768

Download citation

  • DOI: https://doi.org/10.1007/BFb0015768

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39557-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation