Managing Intervals Efficiently in Object-Relational Databases

Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common approaches require the augmentation of index structures which, however, is not supported by existing relational database systems. By design, the new Relational Interval Tree1 (RI-tree) employs built-in indexes on an as-they-are basis and is easy to implement. Whereas the functionality and efficiency of the RI-tree is supported by any off-the-shelf relational DBMS, it is perfectly encapsulated by the object-relational data model. The RI-tree requires O(n/b) disk blocks of size b to store n intervals, O(logbn) I/O operations for insertion or deletion, and O(h

• Type: Conference
• Year: 2000
• Where: VLDB
• Authors: Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
• Keywords: Database, Modern Database Applications, Off-the-shelf Relational Dbms, Relational Database Systems, VLDB 2000