Index Data Structures in Object-Oriented Databases / Edition 1

by Thomas A. Mueck, Martin L. Polaschek

Overview

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.

Product Details

ISBN-13:	9780792399711
Publisher:	Springer US
Publication date:	08/31/1997
Series:	Advances in Database Systems , #7
Edition description:	1997
Pages:	177
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

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.

Editorial Reviews

Provides technical information about current and future issues relating to search data structures used to index large object- oriented databases, for people involved with developing such databases or applications to be used on top of them, or with tuning the performance of application-dependent databases. Assumes a working knowledge of object-oriented modeling and programming concepts and at least a little of algebraic concepts such as sets. Discusses the underlying database model, technical issues of search data structures, type hierarchy indexing, aggregation path indexing, the speedup of collection operations, and performance analysis. Annotation c. by Book News, Inc., Portland, Or.

Booknews