Object-oriented database management systems (OODBMS) are used to imple ment and maintain large object databases on persistent storage. Regardless whether the underlying database model follows the object-oriented, the rela tional or the object-relational paradigm, a key feature of any DBMS product is content based access to data sets. On the one hand this feature provides user-friendly query interfaces based on predicates to describe the desired data. On the other hand it poses challenging questions regarding DBMS design and implementation as well as the application development process on top of the DBMS. The reason for the latter is that the actual query performance depends on a technically meaningful use of access support mechanisms. In particular, if chosen and applied properly, such a mechanism speeds up the execution of predicate based queries. In the object-oriented world, such queries may involve arbitrarily complex terms referring to inheritance hierarchies and aggregation paths. These features are attractive at the application level, however, they increase the complexity of appropriate access support mechanisms which are known to be technically non-trivial in the relational world.

Klappentext

Object-oriented database management systems (OODBMS) are used to imple­ ment and maintain large object databases on persistent storage. Regardless whether the underlying database model follows the object-oriented, the rela­ tional or the object-relational paradigm, a key feature of any DBMS product is content based access to data sets. On the one hand this feature provides user-friendly query interfaces based on predicates to describe the desired data. On the other hand it poses challenging questions regarding DBMS design and implementation as well as the application development process on top of the DBMS. The reason for the latter is that the actual query performance depends on a technically meaningful use of access support mechanisms. In particular, if chosen and applied properly, such a mechanism speeds up the execution of predicate based queries. In the object-oriented world, such queries may involve arbitrarily complex terms referring to inheritance hierarchies and aggregation paths. These features are attractive at the application level, however, they increase the complexity of appropriate access support mechanisms which are known to be technically non-trivial in the relational world.

Inhalt
1 Introduction.- 1.1 Object-oriented databases and indexing.- 1.2 Application aspects.- 2 Database Model.- 2.1 Object Model.- 2.2 Query language issues.- 2.3 Bibliography.- 3 Data Structures and Indexing.- 3.1 Basics.- 3.2 A systematic approach.- 3.3 One-dimensional search data structures.- 3.4 Multi-dimensional Search Data Structures.- 3.5 Bibliography.- 4 Type Hierarchy Indexing.- 4.1 Problem description.- 4.2 Type grouping.- 4.3 Key grouping.- 4.4 Multikey type index.- 4.5 Bibliography.- 5 Aggregation Path Indexing.- 5.1 Problem description.- 5.2 Path decomposition schemes.- 5.3 Bibliography.- 6 Collection Operations.- 6.1 Problem description.- 6.2 Signature files for indexing multi-valued properties.- 6.3 Bibliography.- 7 Performance Analysis An Example.- 7.1 Storage space requirements.- 7.2 Query performance.- References.