Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server

: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index structures and query processing methods for each conceivable data type, present-day object-relational database systems offer extensible indexing frameworks that enable developers to extend the set of built-in index structures by custom access methods. Although these frameworks permit a seamless integration of user-defined indexing techniques into query processing they do not facilitate the actual implementation of the access method itself. In order to leverage the applicability of indexing frameworks, relational access methods such as the Relational Interval Tree (RI-tree), an efficient index structure to process interval intersection queries, mainly rely on the functionality, robustness and performance of built-in indexes, thus simplifying the index implementation significantly. To investigate the behavior and ...

• Type: Conference
• Year: 2005
• Where: BTW
• Authors: Christoph Brochhaus, Jost Enderle, Achim Schlosser, Thomas Seidl, Knut Stolze
• Keywords: Access Method, BTW 2005, Index Structure, Indexing Framework