Batched interpolation searching on databases

This paper examines the effect of batching search requests in the interpolation search algorithm on ordered tables in main memory as well as in a more typical database environment, i.e. a blocked secondary memory. Experiments were performed on several hybrid interpolation search algorithms over nonuniformly distributed data. The effect of batching on these algorithms is examined in terms of algorithms, analysis, and experiments. Algorithms, analytic expressions, and experimental results on these extensions are given and described. Analytic expressions for these algorithms are validated by experiments.