Analysis and Comparison of Binary and Interpolation Search Algorithms in a B-tree

The consecutive increasing management of large amounts of information in various fields requires the development and construction of efficient database management systems. These systems implement storage, organization, and management of this data in order to perform multiple operations to solve complex and difficult problems. In order to achieve the aforementioned needs, indexing systems have been developed in the context of relational database management systems (RDBMSs). RDBMSs are composed of multiple mechanisms comprising a set of algorithms and data structures. This paper analyzes the performance of the B-tree data structure which laid the foundation as a structural and functional basis for the development of a whole category of tree indexing structures. B-tree indexes have applications in the largest modern RDBMs. Specifically, we study the effect of binary and interpolation search algorithmic techniques on the execution time of the insertion, deletion, and search functions of the B-tree. The computational experiments demonstrate the superiority of the interpolation search technique in the functional level of searching by primary key field.