Interpolation search—a log logN search

  title={Interpolation search—a log logN search},
  author={Yehoshua Perl and Alon Itai and Haim Avni},
  journal={Commun. ACM},
Interpolation search is a method of retrieving a desired record by key in an ordered file by using the value of the key and the statistical distribution of the keys. It is shown that on the average log logN file accesses are required to retrieve a key, assuming that the N keys are uniformly distributed. The number of extra accesses is also estimated and shown to be very low. The same holds if the cumulative distribution function of the keys is known. Computational experiments confirm these… 

Tables from this paper

A Log Log N Search Algorithm for Nonuniform Distributions
In this paper, it is studied how retrieval can be efficiently performed for nonuniform probability distributions.
An adaptation of a root finding method to searching ordered disk files revisited
Interpolation search, Fast search and Pegasus method are compared with respect to their performance in searching ordered disk files for several key distributions and a new approximate formula is derived giving an estimate of the number of page accesses for the Interpolation algorithm under uniform distributions.
An algorithmic and complexity analysis of interpolation search
We begin with a brief survey of the literature concerning the Interpolation Search algorithm, then provide a detailed description of the algorithm and how to implement it to search a particular table
Dynamic Interpolation Search Revisited
A new dynamic Interpolation Search (IS) data structure is presented that achieves O(loglogn) search time with high probability on unknown continuous or even discrete input distributions with
Dynamic interpolation search
A new data structure called Interpolation Search tree (IST) is presented which supports interpolation search and insertions and deletions and for a wide class of probability distributions.
Dynamic Interpolation Search
A new data structure called Interpolation Search tree (IST) is presented which supports interpolation search and insertions and deletions and for a wide class of probability distributions.
Interpolation search for non-independent data
A deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search and a data structure that stores a dynamic set of n integers subject to insertions, deletions, and predecessor/successor queries in O(lg Δ) time per operation is developed.
Analysis of recursive batched interpolation search
For an ordered file of records with uniformly distributed key values, an existing batched searching algorithm based on recursive use of interpolation searches is examined, which outperforms binary-search based algorithms when the batch size passes a threshold value.


File Organization: On the Selection of Random Access Index Points for Sequential Files
An examination is made of the consequences of partially or completely replacing one or more index levels by linear interpolation procedures, for all possible configurations of the several types of key distributions investigated.
Understanding the Complexity of Interpolation Search
Addressing for Random-Access Storage
Estimates are made of the amount of searching required for the exact location of a record in several types of storage systems, including the index-table method of addressing and the sorted-file
The complexity of searching an ordered random table
  • A. Yao, F. F. Yao
  • Computer Science
    17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
  • 1976
Information retrieval is a subject that has received much attention in the literature (e.g. [Kn]). For certain classes of retrieval schemes, questions that arise from optimality considerations have
Sorting and Searching
The first revision of this third volume is a survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and
The art of computer programming: sorting and searching (volume 3)
Apparatus for supporting different nets for various sporting purposes including interengaging tubular rods which are arranged to interconnect and have ground engaging portions suitable to be useful
An Introduction To Probability Theory And Its Applications
A First Course in Probability (8th ed.) by S. Ross is a lively text that covers the basic ideas of probability theory including those needed in statistics.
The Art of Computer Programming
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
A First Course on Stochastic Processes
The Basic Limit Theorem of Markov Chains and Applications and Classical Examples of Continuous Time Markov chains are presented.