Please use this identifier to cite or link to this item:
Title: Indexing OODB instances based on access proximity
Authors: Chan, Chee Yong 
Goh, Cheng Hian 
Ooi, Beng Chin 
Issue Date: 1997
Citation: Chan, Chee Yong,Goh, Cheng Hian,Ooi, Beng Chin (1997). Indexing OODB instances based on access proximity. Proceedings - International Conference on Data Engineering : 14-21. ScholarBank@NUS Repository.
Abstract: Queries in Object-Oriented Databases (OODBs) may be asked with respect to different class scopes: a query may either request for object-instances which belong exclusively to a given class c, or those which belong to any class in the hierarchy rooted at c. To facilitate retrieval of objects both from a single class, as well as from multiple classes in a class hierarchy, we propose a multi-dimensional class hierarchy index called the χ-tree. The χ-tree dynamically partitions the data space using both the class and indexed attribute dimensions by taking into account the semantics of the class dimension as well as access patterns of queries. Experimental results show that it is an efficient index.
Source Title: Proceedings - International Conference on Data Engineering
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Dec 2, 2021

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.