On the Selection of Optimal Index Configuration in OO Databases

An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing technique

On the Selection of Optimal Index Configuration in OO Databases

An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. We address the problem of optimal index configuration for a single path. As it will be shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. We present an algorithm which is able to select an optimal index configuration for a given path. For the moment we consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multiinherited index) but the principles of the algorithm will remain the same adding more indexing techniques. 1 Introduction Object-oriented data models are based on some fundamental concepts which will be discussed briefly. A real world entity is represented by an object. Each object is uniquely identified by an object identifier (oid) which is supposed..