Paper Info
Title
Indexing OODB instances based on access proximity
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
Year
DOI
Venue
1997
10.1109/ICDE.1997.581735
ICDE
Keywords
Field
DocType
class dimension semantics,access pattern,multi-dimensional class-hierarchy index,class hierarchy,object-instance indexing,χ-tree,tree dynamically,tree data structures,efficient index,object-oriented databases,indexing,class scopes,single class,different class scope,multiple class,database theory,class dimension,access proximity,object-oriented database querying,indexing oodb,query access patterns,object retrieval,data space dynamic partitioning,spl chi,indexed attribute dimensions,query processing,indexation,information systems,computer science
Data mining,Data space,Computer science,Tree (data structure),Search engine indexing,Class hierarchy,Theoretical computer science,Database theory,Hierarchy,Class variable,Semantics,Database
Conference
ISSN
ISBN
Citations 
1063-6382
0-8186-7807-0
14
PageRank 
References 
Authors
30.56
8
3
Name
Order
Citations
PageRank
Chee Yong Chan1643199.24
Cheng Hian Goh2480164.96
Beng Chin Ooi378731076.70