Dynamic Interpolation B-Tree: A New Access Method

The performance of Object-Oriented Database depends on the access method implemented in the data model. Dynamic Interpolation B-tree (DIB) is a new indexing technique supporting query processing in Object-Oriented Databases which is effective and efficient for multimedia databases. This is a new access method which supports range queries on Object-Oriented Databases. DIB supports inheritance and aggregation hierarchies. DIB has the structure of Dynamic Interpolation B-tree. Dynamic Interpolation B-tree consists of hashing and B-tree. Both hashing and B-tree are dynamic. DIB technique is compared with other techniques obtained from more traditional organizations. In this new technique all the operations are done efficiently. The result shows that the Dynamic Interpolation B-tree is significantly better than the traditional indexing methods over a wide range of parameters in terms of range of parameters, retrieval and update cost so that the storage overhead grows slowly with the number of indexed attributes.