A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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. Dynamicdoi:10.5120/2206-2804 fatcat:fsr6m55lrngxxe6gsjserqre5e