Please use this identifier to cite or link to this item:
|Title:||Index nesting - An efficient approach to indexing in object-oriented databases|
|Authors:||Ooi, B.C. |
|Citation:||Ooi, B.C.,Han, J.,Lu, H.,Tan, K.L. (1996). Index nesting - An efficient approach to indexing in object-oriented databases. VLDB Journal 5 (3) : 215-228. ScholarBank@NUS Repository.|
|Abstract:||In object-oriented database systems where the concept of the superclass-subclass is supported, an instance of a subclass is also an instance of its superclass. Consequently, the access scope of a query against a class in general includes the access scope of all its subclasses, unless specified otherwise. An index to support superclass-subclass relationship efficiently must provide efficient associative retrievals of objects from a single class or from several classes in a class hierarchy. This paper presents an efficient index called the hierarchical tree (the H-tree). For each class, an H-tree is maintained, allowing efficient search on a single class. These H-trees are appropriately linked to capture the superclass-subclass relationships, thus allowing efficient retrievals of instances from a class hierarchy. Both experimental and analytical results indicate that the H-tree is an efficient indexing structure. © Springer-Verlag 1996.|
|Source Title:||VLDB Journal|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.