Abstract
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.
Recommended Citation
J. Han et al., "Join Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-oriented Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 2, pp. 321 - 337, Institute of Electrical and Electronics Engineers, Jan 1999.
The definitive version is available at https://doi.org/10.1109/69.761666
Department(s)
Computer Science
International Standard Serial Number (ISSN)
1041-4347
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Jan 1999
Comments
Natural Sciences and Engineering Research Council of Canada, Grant HMI-5