Skip to main content
SpringerLink
Log in
Book cover

International Conference on Deductive and Object-Oriented Databases

DOOD 1991: Deductive and Object-Oriented Databases pp 68–84Cite as

Efficient access methods in deductive and object-oriented databases

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 566))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal: Alpha: An extension of relational algebra to express a class of recursive queries. IEEE Transactions on Software Engineering, 14 (3), 879–885, (1988).

    Google Scholar 

  2. A. Aho, J. Ullman: Universality of data retrieval languages. Proc. of the 6th POPL, (1979).

    Google Scholar 

  3. I. Balbin, K. Ramamohanarao: A generalization of the differential approach to recursive query evaluation. Journal of Logic Programming, September (1987).

    Google Scholar 

  4. F. Bancilhon: Naive evaluation of recursively defined relations. In Knowledge Base Management Systems — Integrating Database and AI Systems, ed. Brodie and Mylopoulos, Springer-Verlag, (1985).

    Google Scholar 

  5. F. Bancilhon, R. Ramakrishnan: An amateur's introduction to recursive query processing strategies. Proc. ACM-SIGMOD Intl. Conf. on Management of Data, Washington D.C. (1986).

    Google Scholar 

  6. E. Bertino, W. Kim: Indexing techniques for queries on nested objects. IEEE Trans. Knowledge and Data Engineering, 1(2), 196–214 (1989).

    Google Scholar 

  7. M. Carey, D. DeWitt, J. Richardson, E. Shekita: Object and file management in the EXODUS extensible database system. Proc. Int. Conf. on Very Large Data Bases, Kyoto, Japan (1986).

    Google Scholar 

  8. D. Comer: The ubiquitous B-tree. ACM Computing Surveys, 11(2), 121–137 (1979).

    Google Scholar 

  9. A. Kemper, G. Moerkotte: Access support in object bases. Proc. ACMSIGMOD Intl. Conf. on Management of Data, 364–374 (1990).

    Google Scholar 

  10. W. Kim, K. C. Kim, A. Dale: Indexing techniques for object-oriented database. In W. Kim and F. H. Lochovsky (ed): Object-oriented Concepts, Databases, and Applications, Addison-Wesley, 371–394 (1989).

    Google Scholar 

  11. C. C. Low, B. C. Ooi, H. Lu: H-Tree — A dynamic hierarchical indexing structure, Tech. Report, Institute of Systems Science, National University of Singapore, submitted for publication (1991).

    Google Scholar 

  12. H. Lu, M. C. Shan: B+-Tree: A new access method supporting least fixed point computation of recursive relations. Proc. of the Intl. Computer Sc. Conference '88, Hong Kong, 257–264, (1988).

    Google Scholar 

  13. H. Lu, L. L. Yan: Least fixed point computation in deductive databases, unpublished manuscript, Dept. of Info. Sys. and Computer Sc., National University of Singapore, (1991).

    Google Scholar 

  14. D. Maier, J. Stein: Indexing in an object-oriented DBMS. IEEE Proc. Intl. Workshop on Object-Oriented Database Systems, Pacific Grove, G.A., 171–182 (1986).

    Google Scholar 

  15. A. Tarski: A lattice-theoretical fixed point theorem and its application. Pacific J. Mathematics, 5(2), 285–309 (1955).

    Google Scholar 

  16. P. Valduriez, S. Khoshafian, G. Copeland: Implementation of techniques of complex objects. Proc. Intl. Conf. on Ver Large Data Bases, Kyoto, Japan, 101–110 (1986).

    Google Scholar 

Download references

Author information

Author notes

  1. Chee Chin Low

    Present address: Asia Links, Hong Kong

Authors and Affiliations

  1. National University of Singapore, 0511, Kent Ridge, Singapore

    Chee Chin Low, Hongjun Lu & Beng Chin Ooi

  2. Simon Fraser University, V5A 1S6, Burnaby, British Columbia, Canada

    Jiawei Han

Authors
  1. Chee Chin Low
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongjun Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beng Chin Ooi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiawei Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Delobel M. Kifer Y. Masunaga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Low, C.C., Lu, H., Ooi, B.C., Han, J. (1991). Efficient access methods in deductive and object-oriented databases. In: Delobel, C., Kifer, M., Masunaga, Y. (eds) Deductive and Object-Oriented Databases. DOOD 1991. Lecture Notes in Computer Science, vol 566. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55015-1_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-55015-1_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55015-0

  • Online ISBN: 978-3-540-46646-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation