Efficient access methods in deductive and object-oriented databases

Chee Chin Low, Hongjun Lu, Beng Chin Ooi, Jiawei Han

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish (US)
Title of host publicationDeductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings
EditorsYoshifumi Masunaga, Michael Kifer, Claude Delobel
Number of pages17
ISBN (Print)9783540550150
StatePublished - 1991
Externally publishedYes
Event2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991 - Munich, Germany
Duration: Dec 16 1991Dec 18 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume566 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Efficient access methods in deductive and object-oriented databases'. Together they form a unique fingerprint.

Cite this