Integrity Constraints: Semantics and Applications

  • Parke Godfrey
  • John Grant
  • Jarek Gryz
  • Jack Minker


Integrity constraints axe introduced in a logical framework. Examples are given to illustrate the expressiveness of integrity constraints. Various definitions for the semantics of integrity constraints are defined and compared. Additional types of constraints are also mentioned. Techniques of reasoning with integrity constraints, including model elimination and the residue method, are explained. Applications of integrity constraints considered in detail, including semantic query optimization, cooperative answering, combining databases, and view updates. Additional applications to order optimization, query folding, object-oriented databases, and database security are sketched. The conclusion lists areas of integrity constraints that need to be investigated.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AHV95]
    S. Abiteboul, R. Hall, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading, Massachusetts, 1995.MATHGoogle Scholar
  2. [BJ89]
    G.S. Boolos and R.C. Jeffrey. Computability and Logic. Open University Set Book. Cambridge University Press, 3rd edition, 1989.Google Scholar
  3. [BJNS94]
    M. Buchheit, M.A. Jeusfeld, W. Nutt, and M. Staudt. Subsumption Between Queries to Object-Oriented Databases. Information Systems, 19(1):33–54, January 1994.CrossRefGoogle Scholar
  4. [BK98]
    A. Bonner and M. Kifer. Logic Programming for Database Transactions. In Chomicki and Saake [CS98], chapter 5, pp. 117–166.Google Scholar
  5. [BKM91]
    C. Baral, S. Kraus, and J. Minker. Combining Multiple Knowledge Bases. IEEE TKDE, 3(2):208–220, July 1991.Google Scholar
  6. [BKMS92]
    C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian. Combining Knowledge Bases Consisting of First Order Theories. Computational Intelligence, 8:45–71, 1992.CrossRefGoogle Scholar
  7. [BKMS94]
    C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian. Combining Default Logic Databases. Intl. Journal of Intelligent and Cooperative Info. Systems, 3(3):319–348, 1994.CrossRefGoogle Scholar
  8. [BKS92]
    P.A. Bonatti, S. Kraus, and V.S. Subrahmanian. Declarative Foundations of Secure Deductive Databases. In J. Biskup and R. Hull, editors, 4th Intern. Conf. on Database Theory (ICDT′92), Lecture Notes in Computer Science, Vol. 646, pp. 391–406, Berlin, October 1992. Springer.Google Scholar
  9. [Bry96]
    F. Bry. A Compositional Semantics for Logic Programs and Deductive Databases. In Proc. Joint Intern. Confänd Symp. on Logic Programming, Bad Honnef, Germany, September 1996. MIT Press.Google Scholar
  10. [CD87]
    L. Cholvy and R. Demolombe. Querying a Rule Base. In L. Kershberg, editor, Expert Database Systems, Tysons Corner, Virginia, 1987.Google Scholar
  11. [CGM86a]
    U.S. Chakravarthy, J. Grant, and J. Minker. Foundations of Semantic Query Optimization for Deductive Databases. In J. Minker, editor, Proceedings of the Workshop on Foundations of Deductive Databases and Logic Programming, pp. 67–101, Washington, D.C., August 1986.Google Scholar
  12. [CGM86b]
    U.S. Chakravarthy, J. Grant, and J. Minker. Semantic Query Optimization: Additional Constraints and Control Strategies. In L. Kerschberg, editor, Proceedings of Expert Database Systems, pp. 259–269, Charleston, April 1986.Google Scholar
  13. [CGM90]
    U.S. Chakravarthy, J. Grant, and J. Minker. Logic Based Approach to Semantic Query Optimization. ACM Transactions on Database Systems, 15(2):162–207, June 1990.CrossRefGoogle Scholar
  14. [Cha93]
    E. Chan. A Possible World Semantics for Disjunctive Databases. IEEE TDKE, 5(2):282–292, 1993.Google Scholar
  15. [Cho90]
    L. Cholvy. Answering queries addressed to a rule base. Revue d’intelligence artificielle, 4(1):79–98, 1990.Google Scholar
  16. [CKPS95]
    S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing Queries with Materialized Views. In Proceedings of the 11th ICDE, pp. 190–200, 1995.Google Scholar
  17. [Cla78]
    K.L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 293–322. Plenum Press, New York, 1978.CrossRefGoogle Scholar
  18. [Con98]
    S. Conrad. A Logic Primer. In Chomicki and Saake [CS98], chapter 2, pp. 5–30.Google Scholar
  19. [CR94]
    C.M. Chen and N. Roussopoulos. The Implementation and Performance Evaluation of the ADMS Query Optimizer: Integrating Query Result Caching and Matching. In Proc. 4th Intern. Conf. on Extending Database Technology, Cambridge, U.K., 1994.Google Scholar
  20. [CS98]
    J. Chomicki and G. Saake, editors. Logics for Databases and Information Systems. Kluwer Academic Publishers, Boston, 1998.MATHGoogle Scholar
  21. [CT98]
    J. Chomicki and D. Toman. Temporal Logic in Information Systems. In Chomicki and Saake [CS98], chapter 3, pp. 31–70.Google Scholar
  22. [Das92]
    S.K. Das. Deductive Databases and Logic Programming. Addison— Wesley, Wokingham, England, 1992.MATHGoogle Scholar
  23. [DFJ+96]
    S. Dar, M. Franklin, B. Jónsson, D. Srivastava, and M. Tan. Semantic Data Caching and Replacement. In Proceedings of VLDB, 1996.Google Scholar
  24. [DJ96]
    R. Demolombe and A. Jones. Integrity Constraints Revisited. Journal of IGPL, 4(3):369–383, 1996.MathSciNetMATHCrossRefGoogle Scholar
  25. [DL97]
    O. Duschka and A. Levy. Recursive Plans for Information Gathering. In Proc. of 15th IJCAI, Nagoya, Japan, August 1997.Google Scholar
  26. [EGM97]
    T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM Transactions on Database Systems, 22(3):364–418, 1997.CrossRefGoogle Scholar
  27. [Fag91]
    F. Fages. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing, 9:425–443, 1991.CrossRefGoogle Scholar
  28. [Fer94]
    J.A. Fernández. Disjunctive Deductive Databases. PhD thesis, University of Maryland, Department of Computer Science, College Park, 1994.Google Scholar
  29. [FGM96]
    J.A. Fernández, J. Grant, and J. Minker. Model Theoretic Approach to View Updates in Deductive Databases. Journal of Automated Reasoning, 17(2):171–197, 1996.MathSciNetMATHCrossRefGoogle Scholar
  30. [FLMS93]
    J.A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive LP + integrity constraints = stable model semantics. Annals of Mathematics and Artificial Intelligence, 8(3-4):449–474, 1993.MathSciNetMATHCrossRefGoogle Scholar
  31. [GA93]
    P.W.P.J. Grefen and P.M.G. Apers. Integrity Control in Relational Database Systems: An Overview. Data and Knowledge Engineering, 10:187–223, 1993.CrossRefGoogle Scholar
  32. [Gaa92]
    T. Gaasterland. Cooperative Answers for Database Queries. PhD thesis, University of Maryland, Department of Computer Science, College Park, 1992.Google Scholar
  33. [Gal88]
    A. Gal. Cooperative Responses in Deductive Databases. PhD thesis, Department of Computer Science, University of Maryland, College Park, Maryland, 1988.Google Scholar
  34. [GG96a]
    P. Godfrey and J. Gryz. A Framework for Intensional Query Optimization. In D. Boulanger, U. Geske, F. Giannotti, and D. Seipel, editors, Proc. Workshop on Deductive Databases and Logic Programming, GMD-Studien Nr. 295, pp. 57–68, Bonn, Germany, September 1996. GMD-Forschungszentrum. Held in conjunction with IJCSLP′96.Google Scholar
  35. [GG96b]
    P. Godfrey and J. Gryz. Intensional Query Optimization. Technical Report CS-TR-3702, UMIACS-TR-96-72, Dept. of Computer Science, University of Maryland, College Park, MD 20742, October 1996.Google Scholar
  36. [GG97]
    P. Godfrey and J. Gryz. Overview of Dynamic Query Evaluation in Intensional Query Optimization. In Proc. 5th Intern. Conf. on Deductive and Object-Oriented Databases (DOOD, Montreux, Switzerland, December 1997. See also [GG96b].Google Scholar
  37. [GGM92]
    T. Gaasterland, P. Godfrey, and J. Minker. An Overview of Cooperative Answering. Journal of Intelligent Information Systems, 1(2):123–157, 1992. Invited paper.CrossRefGoogle Scholar
  38. [GGM94]
    T. Gaasterland, P. Godfrey, and J. Minker. An Overview of Cooperative Answering. In R. Demolombe and T. Imielinski, editors, Nonstandard Queries and Nonstandard Answers, Studies in Logic and Computation 3, chapter 1, pp. 1–40. Clarendon Press, Oxford, 1994. Appears orginally as [GGM92].Google Scholar
  39. [GGM96]
    P. Godfrey, J. Gryz, and J. Minker. Semantic Query Optimization for Bottom-Up Evaluation. In Z.W. Ras and M. Michalewicz, editors, Foundations of Intelligent Systems: Proc. 9th Intern. Symp. on Methodologies for Intelligent Systems, LNAI 1079, pp. 561–571, Berlin, June 1996. Springer.Google Scholar
  40. [GGMR97]
    J. Grant, J. Gryz, J. Minker, and L. Raschid. Semantic Query Optimization in Object Databases. In Proceedings of ICDE, pp. 444–453, Birmingham, UK, Apr 7-11 1997. IEEE Computer Science Press, Los Amitos, California.Google Scholar
  41. [GHLM93]
    J. Grant, J. Horty, J. Lobo, and J. Minker. View updates in stratified disjunctive databases. Journal Automated Reasoning, 11:249–267, March 1993.MathSciNetMATHCrossRefGoogle Scholar
  42. [GL88]
    M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In R.A. Kowalski and K.A. Bowen, editors, Proc. 5th International Conference and Symposium on Logic Programming, pp. 1070–1080, Seattle, Washington, August 15-19 1988.Google Scholar
  43. [GL94]
    T. Gaasterland and J. Lobo. Qualified Answers That Reflect User Needs and Preferences. In Proceedings of VLDB, pp. 309–320, Santiago de Chile, Chile, 1994.Google Scholar
  44. [GM85]
    A. Gal and J. Minker. A Natural Language Database Interface that Provides Cooperative Answers. Proc. 2nd Conf. on Artificial Intelligence Applications, December 11-13 1985.Google Scholar
  45. [GM88]
    A. Gal and J. Minker. Informative and Cooperative Answers in Databases Using Integrity Constraints. In V. Dahl and P. Saint—Dizier, editors, Natural Language Understanding and Logic Programming, pp. 277–300. North Holland, 1988.Google Scholar
  46. [GM90]
    J. Grant and J. Minker. Integrity Constraints in Knowledge Based Systems. In Knowledge Engineering, volume II, pp. 1–25. McGraw-Hill, New York, 1990.Google Scholar
  47. [GM91]
    T. Gaasterland and J. Minker. User Needs and Language Generation Issues in a Cooperative Answering System. In P. Saint-Dizier, editor, ICLP′91 Workshop: Advanced Logic Programming Tools and Formalisms for Language Processing, pp. 1–14, INRIA, Paris, France, June 1991.Google Scholar
  48. [GMN94]
    P. Godfrey, J. Minker, and L. Novik. An Architecture for a Cooperative Database System. In W. Litwin and T. Risch, editors, Proc. 1st InternConf. on Applications of Databases, LNCS 819, pp. 3–24. Springer Verlag, Vadstena, Sweden, June 1994.CrossRefGoogle Scholar
  49. [God97a]
    P. Godfrey. An Architecture and Implementation for a Cooperative Database System. PhD thesis, University of Maryland at College Park, College Park, Maryland 20742, 1997. In progress.Google Scholar
  50. [God97b]
    P. Godfrey. Minimization in Cooperative Response to Failing Database Queries. International Journal of Cooperative Information Systems (IJCIS), 6(2):95–149, June 1997.CrossRefGoogle Scholar
  51. [GRS88]
    A.V. Gelder, K. Ross, and J.S. Schlipf. Unfounded Sets and Well-founded Semantics for General Logic Programs. In Proceedings of the 7th Symposium on Principles of Database Systems, pp. 221–230, 1988.Google Scholar
  52. [Gry98]
    J. Gryz. Query Folding with Inclusion Dependencies. In Proc. of 14th ICDE, Orlando, Florida, 1998.Google Scholar
  53. [HZ80]
    M. Hammer and S. Zdonik. Knowledge-Based Query Processing. Proc. 6th International Conference on Very Large Data Bases, pp. 137–147, October 1980.Google Scholar
  54. [Imi88]
    T. Imieliński. Intelligent Query Answering in Rule Based Systems. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann Pub., 1988.Google Scholar
  55. [KB96]
    A.M. Keller and J. Basu. A predicate-based caching scheme for client-server database architectures. The VLDB Journal, 5(2):35–47, April 1996.CrossRefGoogle Scholar
  56. [Kin81]
    J. King. QUIST: A System for Semantic Query Optimization in Relational Databases. Proc. 7th International Conference on Very Large Data Bases, pp. 510–517, September 1981.Google Scholar
  57. [Kow78]
    R. Kowalski. Logic for Data Description. In H.G.J. Minker, editor, Logic and Data Bases, pp. 77–102. Plenum Press, New York, 1978.CrossRefGoogle Scholar
  58. [KS88]
    R. Kowalski and F. Sadri. Knowledge Representation without Integrity Constraints, December 1988. Draft manuscript.Google Scholar
  59. [LH88]
    S. Lee and J. Han. Semantic query optimization in recursive databases. In Proc. IEEE Intern. Conf. on Data Engineering, pp. 444–451, 1988.Google Scholar
  60. [LHQ91]
    S. Lee, L. Henschen, and G. Qadah. Semantic query reformulation in deductive databases. In Proc. IEEE Intern. Conf. on Data Engineering, pp. 232–239. IEEE Computer Society Press, 1991.Google Scholar
  61. [LLM98]
    G. Lausen, B. Ludäscher, and W. May. On Logical Foundations of Active Databases. In Chomicki and Saake [CS98], chapter 12, pp. 389–422.Google Scholar
  62. [Llo87]
    J.W. Lloyd. Foundations of Logic Programming. Symbolic Computation—Artificial Intelligence. Springer-Verlag, Berlin, second edition, 1987.Google Scholar
  63. [LM92]
    L.V.S. Lakshmanan and R. Missaoui. On semantic query optimization in deductive databases. In Proc. IEEE International Conference on Data Engineering, pp. 368–375, 1992.Google Scholar
  64. [LMR92]
    J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. M.I.T. Press, Cambridge, Massachusetts, 1992.Google Scholar
  65. [LMSS95]
    A.Y. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. PODS, pp. 95–104, 1995.Google Scholar
  66. [Lov69]
    D. Loveland. Theorem-provers Combining Model Elimination and Resolution. In Meltzer and Michie, editors, Machine Intelligence 4, pp. 73–86. University Press, Edinburgh, 1969.Google Scholar
  67. [LS95]
    A.Y. Levy and Y. Sagiv. Semantic Query Optimization In Datalog Programs. In Proceedings of the ACM Symposium on the Principles of Database Systems (PODS), 1995.Google Scholar
  68. [McS76]
    J. McSkimin. The Use of Semantic Information in Deductive Question-Answering Systems. PhD thesis, University of Maryland, College Park, Maryland 20742, 1976.Google Scholar
  69. [Min82]
    J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction, pp. 292–308, 1982. Also in: Lecture Notes in Computer Science 138, pages 292-308. Springer Verlag, 1982.Google Scholar
  70. [Min96]
    J. Minker. Logic and Databases: a 20 Year Retrospective. In Workshop on Logic in Databases, San Miniato, Italy, July 1996. Invited Keynote Address.Google Scholar
  71. [Mot89]
    A. Motro. Using Constraints to Provide Intensional Answers to Relational Queries. In Proceedings of the Fifteenth International Conference on Very Large Data Bases, August 1989.Google Scholar
  72. [MS93]
    J. Melton and A.R. Simon. Understanding the New SQL: A Complete Guide. Morgan Kaufmann, San Mateo, California, 1993.Google Scholar
  73. [O’L91]
    D.E. O’Leary. Knowledge Discovery as a Threat to Database Security. In G. Piatetsky-Shapiro and W.J. Frawley, editors, Knowledge Discovery in Databases, chapter 30. AAAI Press and MIT Press, Menlo Park, California, 1991.Google Scholar
  74. [PM97]
    S. Pradhan and J. Minker. Using Priorities to Combine Knowledge Bases. Journal of Cooperative Information Systems, 5(2,3):333–364, February 1997.Google Scholar
  75. [PR89]
    A. Pirotte and D. Roelants. Constraints for Improving the Generation of Intensional Answers in Deductive Databases. In Proc. 5th IEEE Intern. Conf. on Data Engineering, 1989.Google Scholar
  76. [PRZ90]
    A. Pirotte, D. Roelants, and E. Zimanyi. Controlled Generation of Intensional Answers. IEEE TKDE, 1990.Google Scholar
  77. [Qia96]
    X. Qian. Query Folding. In Proc. 12th Intern. Conf. on Data Engineering, pp. 48–55, 1996.Google Scholar
  78. [Rei78]
    R. Reiter. On Closed World Data Bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pp. 55–76. Plenum Press, New York, 1978.CrossRefGoogle Scholar
  79. [Rei92]
    R. Reiter. What Should a Database Know? Journal of Logic Programming, 14(1&2):127–153, October 1992.MathSciNetMATHCrossRefGoogle Scholar
  80. [Sak89]
    C. Sakama. Possible Model Semantics for Disjunctive Databases. In Proc. 1st Intern. Conf. on Deductive and Object Oriented Databases (DOOD′89), pp. 337–351, Kyoto, December 1989.Google Scholar
  81. [SSM96]
    D. Simmen, E. Shekita, and T. Malkems. Fundamental Techniques for Order Optimization. In Proceedings of SIGMOD, pp. 57–67, 1996.Google Scholar
  82. [Sti88]
    M. Stickel. A PROLOG Technology Theorem Prover: Implementation by an extended PROLOG compiler. Journal of Automated Reasoning, 4(4):353–380, 1988.MathSciNetMATHCrossRefGoogle Scholar
  83. [TF95]
    B. Thuraisingham and W. Ford. Security Constraint Processing in a Multilevel Secure Distributed Database Management System. IEEE TKDE, 7(2):274–293, April 1995.Google Scholar
  84. [Ull89]
    J.D. Ullman. Principles of Database and Knowledge-Base Systems, Volumes I & II. Princ. of Computer Science Series. Computer Science Press, Inc., Rockville, Maryland, 1988/1989.Google Scholar
  85. [vdM98]
    R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In Chomicki and Saake [CS98], chapter 10, pp. 307–356.Google Scholar
  86. [YK93]
    J.P. Yoon and L. Kerschberg. Semantic Query Optimization in Deductive Object-Oriented Databases. In Proc. 3rd Intern. Conf. on Deductive and Object-Oriented Databases, pp. 169–182, 1993.Google Scholar
  87. [YL87]
    H.Z. Yang and P.-Å. Larson. Query Transformation for PSJ-Queries. In Proceedings of the Thirteenth International Conference on Very Large Data Bases, pp. 245–254, 1987.Google Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Parke Godfrey
  • John Grant
  • Jarek Gryz
  • Jack Minker

There are no affiliations available

Personalised recommendations