A novel indexing structure - join index hierarchy - is proposed to handle the 'gotos on disk' problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index file, and thus accelerates navigation in object-oriented databases. The method extends the join index structure studied in relational and spatial databases, supports both forward and backward navigations among objects and classes, and localizes update propagations in the hierarchy. Our performance study shows that partial join index hierarchy outperforms several other indexing mechanisms in object-oriented query processing.
|Number of pages
|IEEE Transactions on Knowledge and Data Engineering
|Published - 1999
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics