Skip to main content

On efficient reasoning with implication constraints

  • Conference paper
  • First Online:
Deductive and Object-Oriented Databases (DOOD 1993)

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

Included in the following conference series:

  • 142 Accesses

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.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Chandra,A.K., and Merlin,P.M. Optimal implementation of conjunctive queries in relational databases. Proc. ACM STOC, 77–90, 1976.

    Google Scholar 

  2. Chakravarthy,U.S., Grant,J. and Minker, J., Logic-Based Approach To Semantic Query Optimization, ACM TODS, Vol.15, 1990, pp 162–207.

    Google Scholar 

  3. C-L Chang and R. C. Lee, Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.

    Google Scholar 

  4. C. Elkan, Independence of Logic Database Queries and Updates, Proc. of 9th ACM Symp. on PODS, pp 154–160, 1990.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. J. Han, Constraint-Based Reasoning in Deductive Databases. Proc. of 7th Data Engineering, 1991, pp 257–265.

    Google Scholar 

  7. M.M. Hammer and S.B. Zdonik. Knowlogy Based Query Processing. Proc. 6th VLDB, 1980, pp 137–147.

    Google Scholar 

  8. Kanellakis,P.C., Kuper,G.M., and Revesz,P.Z. Constraint Query Languages, Proc. of 9th ACM Symp. on PODS, pp 288–298, 1990.

    Google Scholar 

  9. J.J. King. QUIST: A System for Semantic Query Optimization in in Relational Databases. Proc. 7th VLDB, 1981, pp 510–517.

    Google Scholar 

  10. Klug,A.,On Conjunctive Queries Containing Inequalities, JACM vol 35:1,pp 147–160,1988.

    Google Scholar 

  11. S. Lee and J. Han, Semantic Query Optimization in Recursive Databases. Proc. of 4th Data Engineering, 1988, pp 444–451.

    Google Scholar 

  12. A. Levy and Y. Sagiv, Constraints and Redundancy in Datalog. Proc. of 11th ACM Symp. on PODS, pp 67–80, 1992.

    Google Scholar 

  13. 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.

    Google Scholar 

  14. A. Motro, Using Integrity Constraints to Provide Intentional Answers to Relational Queries. Proc. 15th VLDB, 1989, pp 237–246.

    Google Scholar 

  15. Ozsoyoglu,Z.M., Shenoy S.T., Ishakbeyoglu N.S., On The Maintenance of Semantic Integrity Constraints, 1990.

    Google Scholar 

  16. H.H. Pang, H.J. Lu, and B.C. Ooi, An Efficient Query Optimization Algorithm. Proc. 7th Data Engineering, 1991, pp 326–335.

    Google Scholar 

  17. 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.

    Google Scholar 

  18. S.T. Shenoy and Z.M. Ozsoyoglu, A System for Semantic Query Optimization. Proc. SIGMOD, 1987.

    Google Scholar 

  19. J.Ullman. Principles of Database and Knowledge-Base systems, volume II., Computer Science Press, 1989.

    Google Scholar 

  20. Xubo Zhang and Z.M.Ozsoyoglu, The Containment and Minimization of Inequality Queries. Tec. Report, CES 92-18, CWRU, 1992

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stefano Ceri Katsumi Tanaka Shalom Tsur

Rights and permissions

Reprints 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

Publish with us

Policies and ethics