Interpolation search—a log logN search

Authors:
Yehoshua Perl;Alon Itai;Haim Avni
Affiliations:
Bar-Ilan Univ., Ramat Gan, Israel;Israel Institute of Technology, Haifa, Israel;The Weizmann Institute of Science, Rehovot, Israel
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 21

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
File Organization: On the Selection of Random Access Index Points for Sequential Files

Journal of the ACM (JACM)

A Monte Carlo comparison of the binary and interpolation search algorithms

SIGCSE '87 Proceedings of the eighteenth SIGCSE technical symposium on Computer science education
Optimal sample cost residues for differential database batch query problems

Journal of the ACM (JACM)
Arithmetic Interpolation Search for Alphabet Tables

IEEE Transactions on Computers
Dynamic interpolation search

Journal of the ACM (JACM)
Finding neighbors on bincode-based images in O (n log log n) time

Pattern Recognition Letters
Median bounds and their application

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The role of parellelism in file organization

CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Implicit Data Structures for the Dictionary Problem

Journal of the ACM (JACM)
A statistical model for the search problem

CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
Interpolation search for non-independent data

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A study of modified interpolation search in compressed, fully transposed, ordered files

SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
B-tree indexes, interpolation search, and skew

DaMoN '06 Proceedings of the 2nd international workshop on Data management on new hardware
Interpolating the air for optimizing wireless data broadcast

Proceedings of the 5th ACM international workshop on Mobility management and wireless access
Index compression is good, especially for random access

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Searching

Algorithms and theory of computation handbook
Efficient parallel lists intersection and index compression algorithms using graphics processing units

Proceedings of the VLDB Endowment
Faster adaptive set intersections for text searching

WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
KenLM: faster and smaller language model queries

WMT '11 Proceedings of the Sixth Workshop on Statistical Machine Translation
Dynamic interpolation search revisited

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Modern B-Tree Techniques

Foundations and Trends in Databases
Serving large-scale batch computed data with project Voldemort

FAST'12 Proceedings of the 10th USENIX conference on File and Storage Technologies

Quantified Score

Hi-index	48.22

Visualization

Abstract

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 results.