TY - GEN
T1 - Efficient access methods in deductive and object-oriented databases
AU - Low, Chee Chin
AU - Lu, Hongjun
AU - Ooi, Beng Chin
AU - Han, Jiawei
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.
PY - 1991
Y1 - 1991
N2 - Recently, a new access method, the Hierarchical-Tree (H-tree) was proposed as an efficient access method for object-oriented database that supports superclass-subclass relationship. We show that, the H-tree indexing scheme is indeed a general access method for the new generation DBMS that most probably will support the object-oriented concept and have the deductive capability. The simplest form of the H-tree, like the widely used B+-tree, can be used to index simple objects for efficient associative search. Its nesting capability provides efficient support to different types of queries that reference objects in superclass-subclass hierarchy. Furthermore, by dynamically nesting the indexes to the objects generated iteratively during recursive query processing, it also supports the least fixed point computation in object-oriented database with deductive capability. This paper examines the use of the H-tree as uniform indexing structure to index objects for efficient query retrieval and, as an efficient implementation of the semi-naive evaluation of least fixed point computation.
AB - Recently, a new access method, the Hierarchical-Tree (H-tree) was proposed as an efficient access method for object-oriented database that supports superclass-subclass relationship. We show that, the H-tree indexing scheme is indeed a general access method for the new generation DBMS that most probably will support the object-oriented concept and have the deductive capability. The simplest form of the H-tree, like the widely used B+-tree, can be used to index simple objects for efficient associative search. Its nesting capability provides efficient support to different types of queries that reference objects in superclass-subclass hierarchy. Furthermore, by dynamically nesting the indexes to the objects generated iteratively during recursive query processing, it also supports the least fixed point computation in object-oriented database with deductive capability. This paper examines the use of the H-tree as uniform indexing structure to index objects for efficient query retrieval and, as an efficient implementation of the semi-naive evaluation of least fixed point computation.
UR - http://www.scopus.com/inward/record.url?scp=0039934907&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0039934907&partnerID=8YFLogxK
U2 - 10.1007/3-540-55015-1_4
DO - 10.1007/3-540-55015-1_4
M3 - Conference contribution
AN - SCOPUS:0039934907
SN - 9783540550150
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 68
EP - 84
BT - Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings
A2 - Masunaga, Yoshifumi
A2 - Kifer, Michael
A2 - Delobel, Claude
PB - Springer
T2 - 2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991
Y2 - 16 December 1991 through 18 December 1991
ER -