Skip to main content
SpringerLink
Log in

On the maintenance of implication integrity constraints

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1993)

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

Included in the following conference series:

Abstract

Semantic integrity constraints are utilized for enforcing the integrity of the database as well as for improving the efficiency of the database utilization, as in semantic query optimization. In this paper we address the problems related with maintaining a sound and nonredundant set of constraints satisfied by the database in the case of updates to the constraint base. We consider implication constraints as semantic integrity constraints. The constraints are represented as conjunctions of inequalities. We present a methodology to determine whether a constraint is redundant or contradictory with respect to a set of constraints. It is based on the partitioning of the constraint base which, we show, improves the efficiency of the algorithms that check whether a constraint is redundant or contradictory with respect to a constraint base.

This research is supported by the National Science Foundation under grant IRI-9008632, and FAW Award IRI-9024152. Part of the research has been carried out while the authors were at Dept. of Computer Engineering and Information Sciences, Bilkent University, Ankara, Türkiye.

The research of this author is partially supported by the Scientific and Technical Research Council of Türkiye.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho A. V., Garey M. R., Ullman J. D., The Transitive Reduction of a Direct Graph, Siam Journal of Computing, 1:2, 1972, 31–7.

    Article  Google Scholar 

  2. Bernstein P. and Blaustein B., A simplification algorithm for integrity assertions and concrete views, Proc. COMPSAC 81, 1981, pp. 90–99.

    Google Scholar 

  3. Böttcher S., Jarke M., Schmidt J W., Adabtive predicate managers in database systems, 12th Int VLDB Conf., Kyoto, 1986, pp. 21–29.

    Google Scholar 

  4. Bry F., Manthey R., Checking consistency of database constraints: a logical basis, 12th Int. VLDB Conf., Kyoto, 1986, pp. 13–20.

    Google Scholar 

  5. Bry F., Decker H., and Manthey R., A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases. Lecture Notes in Computer Science 303 (Proc. EDBT'88), Springer-Verlag 1988, pp. 488–505.

    Google Scholar 

  6. Büning H. K., Löwen U., Schmitgen S., Inconsistency of production systems, Data & Knowledge Engineering 3 (1988/89) pp. 245–260.

    Google Scholar 

  7. Chang C., Lee R. C., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York, 1973.

    Google Scholar 

  8. Elkan C., A Decision Procedure for Conjunctive Query Disjointness, ACM PODS, pp. 134–139, 1989.

    Google Scholar 

  9. Fagin R., Halpern J. Y., and Megiddo N., A Logic for Reasoning about Probabilities, Information and Computation, 87, pp. 78–128, 1990. Springer-Verlag, 1990.

    Article  Google Scholar 

  10. Gallier J H., Logic for Computer Science: Foundations of Automatic Theorem Proving, Harper & Row, Publishers, New York, 1986.

    Google Scholar 

  11. Hsu A. and Imielinski T., Integrity checking for multiple updates, Proc. SIGMOD Conf., 1985, pp.152–168.

    Google Scholar 

  12. Ishakbeyoglu N S. and Ozsoyoglu Z M., Maintenance of Semantic Integrity Constraints under Database Updates, Proc. 6th ISCIS Symposium, Turkey, 1991, pp. 125–134.

    Google Scholar 

  13. Ishakbeyoglu N S., Ozsoyoglu Z M., A Deduction system for implication integrity constraints, Technical Report CIS-9201, Bilkent University, 1992.

    Google Scholar 

  14. Ishakbeyoglu N S., Ozsoyoglu Z M., On the Maintenance of Implication Integrity constraints, Technical Report CES-92-09, Case Western Reserve University, 1992.

    Google Scholar 

  15. Klug A., On Conjunctive Queries Containing Inequalities, JACM 35, 1, pp. 146–160, January 1988.

    Article  Google Scholar 

  16. Kung C. H., A Temporal Framework for Information Systems Specification and Verification. PhD Thesis, Univ. of Trondheim, Norway, 1984.

    Google Scholar 

  17. Manthey R. and Bry F., SATCHMO: a theorem prover implemented in Prolog. Proc. CADE 88 (9th Conf. on Automated Deduction), Argonne, Illinois, May 1988, also ECRC Tech. Rep. KB-21, Nov. 1987.

    Google Scholar 

  18. McCune W. W. and Henschen L. J., Maintaining State Constraints in Relational Databases: A Proof Theoretic Basis, Journal of the ACM, Vol. 36, No. 1, January 1989, pp. 46–68.

    Article  Google Scholar 

  19. Nicolas J-M., Logic for improving integrity checking in relational data bases. Acta Informatica 18, pp. 227–253, 1982

    Article  Google Scholar 

  20. Ozsoyoglu Z M., Ishakbeyoglu N S., and Shenoy S T., On the Maintenance of Semantic Implication Constraints, Technical Report, Dept of Computer Engineering and Science, Case Western Reserve University, Nov. 1991

    Google Scholar 

  21. Ozsoyoglu Z M., Query Optimization in Distributed Databases, PhD Thesis, Dept of Computing Sciences, University of Alberta, Canada, 1980.

    Google Scholar 

  22. Rosenkrantz D J., Hunt H B., Processing Conjunctive Predicates and Queries, Proc. VLDB, 1980, pp. 64–72.

    Google Scholar 

  23. Sadri F. and Kowalski R., A Theorem-proving approach to database integrity, in J. Minker (ed.) Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Pub., 1988, pp. 313–362.

    Google Scholar 

  24. Shenoy S T., Ozsoyoglu Z M., A system for semantic query optimization, Proc. ACM SIGMOD, pp.181–195, May 1987.

    Google Scholar 

  25. Shenoy S T., Ozsoyoglu Z M., Design and implementation of a semantic query optimizer, IEEE Transactions on Knowledge and Data Engineering, pp. 344–361, September 1989.

    Google Scholar 

  26. Ullman J D., Principles of database and knowledge-base systems Vol I, Computer Science Press, 1988.

    Google Scholar 

  27. Ullman J D., Principles of database and knowledge-base systems Vol II, Computer Science Press, 1989.

    Google Scholar 

  28. Yu T C., and Ozsoyoglu Z M., On determining tree query membership of a distributed query, INFOR, Aug. 1984, pp. 261–281.

    Google Scholar 

  29. Yu T C., and Sun W., Automatic knowledge acquisition and maintenance for semantic query optimization, IEEE Transactions on Knowledge and Data Engineering, pp. 362–375, September 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Engineering and Science Department, Case Western Reserve University, 44106, Cleveland, Ohio

    Naci S. Ishakbeyoğlu & Z. Meral Özsoyoğlu

Authors
  1. Naci S. Ishakbeyoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Meral Özsoyoğlu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Vladimír Mařík Jiří Lažanský Roland R. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishakbeyoğlu, N.S., Özsoyoğlu, Z.M. (1993). On the maintenance of implication integrity constraints. In: Mařík, V., Lažanský, J., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 1993. Lecture Notes in Computer Science, vol 720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57234-1_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-57234-1_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57234-3

  • Online ISBN: 978-3-540-47982-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation