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 are performed on several hybrid interpolation search algorithms over non-uniformly distributed data. The effect of batching on these algorithms is examined in terms of algorithms, analysis and experiments. Algorithms, analytic expressions and experimental results of these extensions are given and described. Analytic expressions of these algorithms are validated by experiments.