Dynamic interpolation search
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.
Unable to display preview. Download preview PDF.
- A. Itai, A.G. Konheim, M. Rodeh: “A Sparse Table Implementation of Priority Queues“ Proc. ICALP 81, LNCS 115, 417–431 (1981)Google Scholar
- D. E. Knuth: “Deletions that preserve Randomness“ IEEE Trans.Software Engrg. SE 3, 351–359Google Scholar
- K. Mehlhorn: “Data Structures and Algorithms“ Vol. 1, Sorting and Searching, Springer Verlag, EATCS Monographs in Theoretical Computer Science 1980Google Scholar
- 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
- W.W. Peterson: “Addressing for Random Storage“ IBM J. Res. and Develop. 1, 131–132 (1957)Google Scholar
- D.E. Willard: “Searching Nonuniformly Generated Files in a Log Log N Runtime“ SIAM Journal of Computing, in pressGoogle Scholar
- 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