Index Data Structures in Object-Oriented Databases

Thomas A. Mueck, Martin L. Polaschek

ISBN 10: 0792399714 / ISBN 13: 9780792399711

Published by Kluwer Academic Publishers, US, 1997

About this Item

The purpose of this volume is to provide technical information about current and future issues of search data structures used to index large object-oriented databases. The intended audience of this book includes practitioners involved in OODBMS product selection, application dependent database performance tuning and application development on top of object databases, as well as researchers and students interested in the technical issues of object-oriented databases. The only prerequisite for understanding the material presented in this book is a working knowledge of object-oriented modelling and programming concepts and a minimum knowledge of algebraic concepts like, for example, sets.

Seller Inventory # LU-9780792399711

Bibliographic Details

• Title: Index Data Structures in Object-Oriented Databases
• Publisher: Kluwer Academic Publishers, US
• Publication Date: 1997
• Language: English
• ISBN 10: 0792399714
• ISBN 13: 9780792399711
• Binding: Hardback
• Edition: 1997 ed.
• Condition: New

About this title

Synopsis

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.