Interpolation search—a log logN search

@article{Perl1978InterpolationSL,
  title={Interpolation search—a log logN search},
  author={Y. Perl and A. Itai and H. Avni},
  journal={Commun. ACM},
  year={1978},
  volume={21},
  pages={550-553}
}
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… Expand
104 Citations

Tables and Topics from this paper

An algorithmic and complexity analysis of interpolation search
  • 34
Dynamic Interpolation Search Revisited
  • 31
  • PDF
Dynamic interpolation search
  • 27
  • PDF
Dynamic Interpolation Search
  • 17
Simulating interpolation search
  • 5
Interpolation search for non-independent data
  • 21
  • PDF
Analysis of recursive batched interpolation search
  • S. Lang
  • Computer Science
  • BIT Comput. Sci. Sect.
  • 1990
Batched interpolation searching on databases
  • 2
...
1
2
3
4
5
...