Optimization of object-oriented queries using path indices

Abstract

This paper addresses the problem of efficiently evaluating nested predicates in object-oriented databases. The authors have previously introduced the notion of path index (E. Bertino et al., 1989) that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. They evaluated the performance of the path index in the case of queries containing a single predicate. Here they consider the usage of the path index in the framework of more general queries containing several predicates.<>