Batched Interpolation Search

Abstract

In a previous study an ordered array o/N keys was considered and the problem of locating a batch ofM requested keys was investigated by assuming both batched sequential and batched binary searching. This paper introduces the idea of batched interpolation search, and two variations of the method are presented. Comparisons with the two previously defined methods are also made.

Analysis of recursive batched interpolation search

“…(3) If we use interpolation search instead of binary search in BBS, the resulting algorithm is the Batched Interpolation Search algorithm BIS. This algorithm was proposed and analyzed in [8,10]. To compare the efficiency and robustness of these batched searching algorithms, data points were generated in the simulation using the following uniform, exponential, and gamma distributions as proposed in [1].…”

“…To compare the efficiency and robustness of these batched searching algorithms, data points were generated in the simulation using the following uniform, exponential, and gamma distributions as proposed in [1]. (Similar comparisons were made in [10], but only for uniformly distributed data points.) Uniform:…”

“…In this paper, we examine an existing batched interpolation search algorithm, developed by Manolopoulos et al [10], which uses a div!de-and-conquer technique to perform batched searching. The algorithm, called Recursive Batched Interpolation Search (RBIS) in this paper, is briefly described in Section 2.…”

“…Also, simulation results are presented to compare the algorithm's efficiency with that of alternative batched searching methods, and demonstrate the algorithm's robust performance when the data points are not uniformly distributed. In Section 3, the algorithm's expected-case complexity is formally analyzed; our analysis provides a simple asymptotic bound, as opposed to an iterative formula in [10], for the algorithm's expected-ease complexity. Section 4 concludes the paper with suggestion for further work.…”

An adaptation of a root finding method to searching ordered disk files revisited

“…Future research should derive more accurate approximations. A possible extension of this report would deal with the study of these three, as well as other algorithms on batchcd searching using the methods described in [7]. …”