A path dictionary encodes the connections among objects in the aggregation hierarchy. It has been shown to be an efficient mechanism for supporting nested object queries [6]. In this paper, we present a new method, called the path dictionary index method, which combines indexing techniques with the path dictionary method. We describe the operations of the new mechanism and develop cost modeis for its storage overhead and query and update costs. Finally,