Abstract
In this work access support relations are introduced as a means for optimizing query processing in object-oriented database systems. The general idea is to maintain separate structures (dissociated from the object representation) to redundantly store those object references that are frequently traversed in database queries. The proposed access support relation technique is no longer restricted to relate an object (tuple) to an atomic value (attribute value) as in conventional indexing. Rather, access support relations relate objects with each other and can span over reference chains which may contain collection-valued components in order to support queries involving path expressions. We present several alternative extensions and decompositions of access support relations for a given path expression, the best of which has to be determined according to the application-specific database usage profile. An analytical performance analysis of access support relations is developed. This analytical cost model is, in particular, used to determine the best access support relation extension and decomposition with respect to specific database configuration and usage characteristics.
| Original language | English |
|---|---|
| Pages (from-to) | 117-145 |
| Number of pages | 29 |
| Journal | Information Systems |
| Volume | 17 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 1992 |
| Externally published | Yes |
Keywords
- Indexing
- access cost model
- access methods
- object-oriented database systems
- query optimization