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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
M. Buchheit, M.A. Jeusfeld, W. Nutt, and M. Staudt. Subsumption of queries to object-oriented databases. Information Systems, 19(1):33–54, 1994.
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.
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.
R. Demolombe and T. Imielinski, editors. Nonstandard queries and nonstandard answers. Oxford University Press, 1994.
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.
D.S. Johnson and A. Klug. Optimizing conjunctive queries that contain untyped variables. SIAM Journal of Computation, 12(4):616–640, 1983.
A.Y. Levy and Y. Sagiv. Queries independent of updates. In Proceedings of the 19th VLDB Conference, 1993.
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.
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.
M. Staudt, H.W. Nissen, and M.A. Jeusfeld. Query by class, rule and concept. Journal of Applied Intelligence, 4(2):133–156, 1994.
M. Staudt and K. von Thadden. Subsumption checking in knowledge base systems. Technical Report AIB 95-11, RWTH Aachen, 1995.
J.D. Ullman. Principles of Database and Knowledge-Base Systems, Volume 2: The New Technologies. Computer Science Press, Rockville, MD, 1989.
K. v. Thadden. A subsumption checker for queries in a deductive object base system (in German). Master's thesis, RWTH Aachen, Germany, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Staudt, M., von Thadden, K. (1996). A generic subsumption testing toolkit for knowledge base queries. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034735
Download citation
DOI: https://doi.org/10.1007/BFb0034735
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61656-6
Online ISBN: 978-3-540-70651-9
eBook Packages: Springer Book Archive