The Paradigm of Relational Indexing: A Survey

In order to achieve efficient execution plans for queries comprising userdefined

data types and predicates, the database system has to be provided with appropriate

index structures, query processing methods, and optimization rules. Although

available extensible indexing frameworks provide a gateway to seamlessly integrate

user-defined access methods into the standard process of query optimization and execution, they do not facilitate the actual implementation of the access method itself. An internal enhancement of the database kernel is usually not an option for database developers. The embedding of a custom block-oriented index structure into concurrency control, recovery services and buffer management would cause extensive implementation efforts and maintenance cost, at the risk of weakening the reliability of the entire system. The server stability can be preserved by delegating index operations to an external process, but this approach induces severe performance bottlenecks due to context switches and inter-process communication. Therefore, we present in this paper the paradigm of relational access methods that perfectly fits to the common relational data model and is highly compatible with the extensible indexing frameworks of existing object-relational database systems.


Authors: Kriegel H.-P., Pfeifle M., Pötke M., Seidl T.
Published in: Proc. 10th GI-Conf. on Database Systems for Business, Technology, and the Web (BTW 2003), Leipzig, Germany. GI-Edition Lecture Notes in Informatics, P-26
Publisher: GI - Bonn,Germany
Language: EN
Year: 2003
Pages: 285-304
ISBN: 3-88579-355-5
Conference: BTW
Url:conference homepage
Type: Conference papers (peer reviewed)
Research topic: Fast Access to Complex Data