Abstract
In this paper, we address the complexity issue of reasoning with implication constraints. We consider the problem of deciding whether a conjunctive yes/no-query always produces the empty relation (“no” answer) on database instances satisfying a given set of implication constraints, which we refer to as the IC-refuting problem. We show that several other important problems, such as the query containment problem, are polynomially equivalent to the IC-refuting problem. More importantly, we give criteria for designing a set of implication constraints so that an efficient process, called “units-refutation” process can be used to solve the IC-refuting problem.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chandra,A.K., and Merlin,P.M. Optimal implementation of conjunctive queries in relational databases. Proc. ACM STOC, 77–90, 1976.
Chakravarthy,U.S., Grant,J. and Minker, J., Logic-Based Approach To Semantic Query Optimization, ACM TODS, Vol.15, 1990, pp 162–207.
C-L Chang and R. C. Lee, Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
C. Elkan, Independence of Logic Database Queries and Updates, Proc. of 9th ACM Symp. on PODS, pp 154–160, 1990.
C. Garey M. and Johnson D.S., Computers and Intractability: A Guide to the theory of NP-completeness. W.Freeman and Co., San Francisco, 1979.
J. Han, Constraint-Based Reasoning in Deductive Databases. Proc. of 7th Data Engineering, 1991, pp 257–265.
M.M. Hammer and S.B. Zdonik. Knowlogy Based Query Processing. Proc. 6th VLDB, 1980, pp 137–147.
Kanellakis,P.C., Kuper,G.M., and Revesz,P.Z. Constraint Query Languages, Proc. of 9th ACM Symp. on PODS, pp 288–298, 1990.
J.J. King. QUIST: A System for Semantic Query Optimization in in Relational Databases. Proc. 7th VLDB, 1981, pp 510–517.
Klug,A.,On Conjunctive Queries Containing Inequalities, JACM vol 35:1,pp 147–160,1988.
S. Lee and J. Han, Semantic Query Optimization in Recursive Databases. Proc. of 4th Data Engineering, 1988, pp 444–451.
A. Levy and Y. Sagiv, Constraints and Redundancy in Datalog. Proc. of 11th ACM Symp. on PODS, pp 67–80, 1992.
R. van der Meyden, The Complexity of Querying Infinite Data about Linearly Ordered Domains, Proc. of the 11th ACM Symp. on PODS, pp331–345, 1992.
A. Motro, Using Integrity Constraints to Provide Intentional Answers to Relational Queries. Proc. 15th VLDB, 1989, pp 237–246.
Ozsoyoglu,Z.M., Shenoy S.T., Ishakbeyoglu N.S., On The Maintenance of Semantic Integrity Constraints, 1990.
H.H. Pang, H.J. Lu, and B.C. Ooi, An Efficient Query Optimization Algorithm. Proc. 7th Data Engineering, 1991, pp 326–335.
A. Pirotte and D. Roelants, Constraints for Improving the Generation of Intentional Answers in a Deductive Database. Proc. 5th Data Engineering, 1989, pp 652–659.
S.T. Shenoy and Z.M. Ozsoyoglu, A System for Semantic Query Optimization. Proc. SIGMOD, 1987.
J.Ullman. Principles of Database and Knowledge-Base systems, volume II., Computer Science Press, 1989.
Xubo Zhang and Z.M.Ozsoyoglu, The Containment and Minimization of Inequality Queries. Tec. Report, CES 92-18, CWRU, 1992
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., Ozsoyoglu, Z.M. (1993). On efficient reasoning with implication constraints. In: Ceri, S., Tanaka, K., Tsur, S. (eds) Deductive and Object-Oriented Databases. DOOD 1993. Lecture Notes in Computer Science, vol 760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57530-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-57530-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57530-6
Online ISBN: 978-3-540-48212-3
eBook Packages: Springer Book Archive