Path-index: An approach to the efficient execution of object-oriented queries

摘要

This paper addresses the prolem of efficiently evaluating nested predicates in object-oriented databases. In a previous paper [4] we have introduced the notion of path index that associates the values of a nested attribute with the instances of the class root of a given aggregation hierarchy. In that paper we have evaluated the performance of the path index in the case of queries containing a single predicate. In the present paper we consider the use of the path index in the framework of more general queries containing several predicates.