Index Data Structures in Object-Oriented Databases von Polaschek Martin L. Mueck Thomas A.: New (1997)

Beschreibung

Print on Demand pp. 188 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Bestandsnummer des Verk�ufers 5802984

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Index Data Structures in Object-Oriented Databases
Verlag: Springer
Erscheinungsjahr: 1997
Sprache: Englisch
ISBN-10: 0792399714
ISBN-13: 9780792399711
Einband: Hardcover
Zustand: New

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.