Advertisement

A generic subsumption testing toolkit for knowledge base queries

  • Martin Staudt
  • Kai von Thadden
Expert and Knowledge Based Systems 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)

Abstract

Subsumption checking is a key technique for intensional reasoning in data and knowledge bases, with applications in terminology management, schema integration, query optimization, reuse of materialized views, and cooperative question-answering. However, the demands of these applications differ, and general solutions covering all these aspects are undecidable or at least computationally intractable. We have therefore implemented a generic approach from which subsumption testers can be configured by tuning certain parameters. Specific contributions include a coverage of negation and the exploitation of semantic knowledge. An application in the ConceptBase system, a deductive object manager for meta data, indicates the practical usefulness of the approach.

Keywords

Integrity Constraint Conditional Fact Query Optimization Conjunctive Query Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.V. Aho, Y. Sagiv, and J.D. Ullman. Efficient optimization of a class of relational expressions. ACM Transactions on Database Systems, 4(4):435–454, 1979.CrossRefGoogle Scholar
  2. 2.
    F. Bry. Logic programming as constructivism: a formalization and its application to databases. In Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 34–50, 1989.Google Scholar
  3. 3.
    M. Buchheit, M.A. Jeusfeld, W. Nutt, and M. Staudt. Subsumption of queries to object-oriented databases. Information Systems, 19(1):33–54, 1994.CrossRefGoogle Scholar
  4. 4.
    E.P.F. Chan. Containment and minimization of positive conjunctive queries in OODB's. In Proc. 11th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 202–211, 1992.Google Scholar
  5. 5.
    S. Chaudhuri and M.Y. Vardi. On containment of recursive datalog programs in nonrecursive programs. In Proc. 11th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 55–66, 1992.Google Scholar
  6. 6.
    R. Demolombe and T. Imielinski, editors. Nonstandard queries and nonstandard answers. Oxford University Press, 1994.Google Scholar
  7. 7.
    M. Jarke, R. Gallersdörfer, M.A. Jeusfeld, M. Staudt, and S. Eherer. ConceptBase — a deductive object base for meta data management. Journal of Intelligent Information Systems, Special Issue on Deductive and Object-Oriented Databases, M. Kifer, editor, 4(2):167–192, March 1995.Google Scholar
  8. 8.
    D.S. Johnson and A. Klug. Optimizing conjunctive queries that contain untyped variables. SIAM Journal of Computation, 12(4):616–640, 1983.CrossRefGoogle Scholar
  9. 9.
    A.Y. Levy and Y. Sagiv. Queries independent of updates. In Proceedings of the 19th VLDB Conference, 1993.Google Scholar
  10. 10.
    Y. Sagiv. Optimizing Datalog programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 659–698. Morgan Kaufmann, Los Altos, CA, 1988.Google Scholar
  11. 11.
    O. Shmueli. Decidability and expressiveness aspects of logic queries. In Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, pages 237–249, 1987.Google Scholar
  12. 12.
    M. Staudt, H.W. Nissen, and M.A. Jeusfeld. Query by class, rule and concept. Journal of Applied Intelligence, 4(2):133–156, 1994.CrossRefGoogle Scholar
  13. 13.
    M. Staudt and K. von Thadden. Subsumption checking in knowledge base systems. Technical Report AIB 95-11, RWTH Aachen, 1995.Google Scholar
  14. 14.
    J.D. Ullman. Principles of Database and Knowledge-Base Systems, Volume 2: The New Technologies. Computer Science Press, Rockville, MD, 1989.Google Scholar
  15. 15.
    K. v. Thadden. A subsumption checker for queries in a deductive object base system (in German). Master's thesis, RWTH Aachen, Germany, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Martin Staudt
    • 1
  • Kai von Thadden
    • 2
  1. 1.Informatik VRWTH AachenAachenGermany
  2. 2.Thyssen Informatik GmbHKrefeldGermany

Personalised recommendations