Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,635,707 papers from all fields of science
Search
Sign In
Create Free Account
Interpolation search
Known as:
Extrapolation search
Interpolation search is an algorithm for searching for a given key in an indexed array that has been ordered by numerical values assigned to the keys…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
14 relations
Algorithm
B-tree
Binary search algorithm
C++
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?
Peter Van Sandt
,
Yannis Chronis
,
J. Patel
SIGMOD Conference
2019
Corpus ID: 195259580
In this paper, we focus on the problem of searching sorted, in-memory datasets. This is a key data operation, and Binary Search…
Expand
2011
2011
Motion estimation using two-stage predictive search algorithms based on joint spatio-temporal correlation information
Lili Hsieh
,
Wen-Shiung Chen
,
Chuan-Hsi Liu
Expert Syst. Appl.
2011
Corpus ID: 44541723
2006
2006
Dynamic Interpolation Search Revisited
A. Kaporis
,
C. Makris
,
S. Sioutas
,
A. Tsakalidis
,
K. Tsichlas
,
C. Zaroliagis
ICALP
2006
Corpus ID: 1359539
A new dynamic Interpolation Search (IS) data structure is presented that achieves O(loglogn) search time with high probability on…
Expand
Review
2004
Review
2004
An algorithmic and complexity analysis of interpolation search
G. Gonnet
,
Lawrence D. Rogers
,
J. A. George
Acta Informatica
2004
Corpus ID: 11696430
We begin with a brief survey of the literature concerning the Interpolation Search algorithm, then provide a detailed description…
Expand
2004
2004
Interpolation search for non-independent data
E. Demaine
,
T. Jones
,
M. Patrascu
SODA '04
2004
Corpus ID: 20968373
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search…
Expand
1990
1990
Fast Updating of Well-Balanced Trees
A. Andersson
,
Tony W. Lai
SWAT
1990
Corpus ID: 206635350
We focus on the problem of maintaining binary search trees with an optimal and near-optimal number of incomplete levels. For a…
Expand
1985
1985
Dynamic Interpolation Search
K. Mehlhorn
,
A. Tsakalidis
ICALP
1985
Corpus ID: 45138711
We present a new data structure called Interpolation Search tree (IST) which supports interpolation search and insertions and…
Expand
1979
1979
Efficient Ordering of Hash Tables
G. Gonnet
,
J. I. Munro
SIAM J. Comput.
1979
Corpus ID: 15282312
We discuss the problem of hashing in a full or nearly full table using open addressing. A scheme for reordering the table as new…
Expand
Highly Cited
1978
Highly Cited
1978
Interpolation search—a log logN search
Y. Perl
,
A. Itai
,
H. Avni
CACM
1978
Corpus ID: 11089655
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…
Expand
Highly Cited
1976
Highly Cited
1976
The complexity of searching an ordered random table
A. Yao
,
F. F. Yao
17th Annual Symposium on Foundations of Computer…
1976
Corpus ID: 18457333
Information retrieval is a subject that has received much attention in the literature (e.g. [Kn]). For certain classes of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE