Referential actions: From logical semantics to implementation

  • Bertram LudÄscher
  • Wolfgang May
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1377)


Referential actions (rac's) are specialized triggers used to automatically maintain referential integrity. While their local effects can be grasped easily, it is far from obvious what the global semantics of a set RA of interacting rac's should be. To capture the intended meaning of RA, we first present an abstract non-constructive semantics. By formalizing RA as a logic program Pra, a constructive semantics is obtained. The equivalence of the logic programming semantics and the abstract semantics is proven using a game-theoretic characterization, which provides additional insight into the meaning of rac's. As shown in previous work, for general rac's, it may be infeasible to compute all maximal admissible solutions. Therefore, we focus on a tractable subset, i.e., rac's without modifications. We show that in this case a unique maximal admissible solution exists, and derive a ptime algorithm for computing this solution. In case a set U⊳ of user requests is not admissible, a maximal admissible subset of U⊳ is suggested.


Logic Program Logic Programming Stable Model User Request Abstract Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CPM96]
    R. Cochrane, H. Pirahesh, and N. Mattos. Integrating Triggers and Declarative Constraints in SQL Database Sytems. In Proc. VLDB, pp. 567–578, Mumbai (Bombay), India, 1996.Google Scholar
  2. [Dat90]
    C. Date. Relational Database Writings 1985–1989. Addison-Wesley, 1990.Google Scholar
  3. [DD94]
    C. Date and H. Darwen. A Guide to the SQL Standard: A User's Guide to the Standard Relational Language SQL. Addison-Wesley, 1994.Google Scholar
  4. [GL88]
    M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. ICLP, pp. 1070–1080, 1988.Google Scholar
  5. [Hor92]
    B. M. Horowitz. A Run-Time Execution Model for Referential Integrity Maintenance. In Proc. Intl. Conf. on Data Engineering, pp. 548–556, 1992.Google Scholar
  6. [ISO92]
    ISO/IEC JTC1/SC21. Information Technology — Database Languages — SQL2, July 1992. ANSI, 1430 Broadway, New York, NY 10018.Google Scholar
  7. [ISO95]
    ISO/ANSI Working draft. Database Languages — SQL3, October 1995.Google Scholar
  8. [LML96]
    B. LudÄscher, W. May, and G. Lausen. Nested Transactions in a Logical Language for Active Rules. In Proc. Intl. Workshop on Logic in Databases (LID), LNCS 1154, pp. 196–222, 1996. Springer.Google Scholar
  9. [LML97a]
    B. LudÄscher, W. May, and G. Lausen. Referential Actions as Logical Rules. In Proc. PODS'97, pp. 217–224, 1997.Google Scholar
  10. [LML97b]
    B. LudÄscher, W. May, and G. Lausen. Triggers, Games, and Stable Models. Technical report, Institut für Informatik, UniversitÄt Freiburg, 1997.Google Scholar
  11. [LMR96]
    B. LudÄscher, W. May, and J. Reinert. Towards a Logical Semantics for Referential Actions in SQL. In Proc. 6th Intl. Workshop on Foundations of Models and Languages for Data and Objects: Integrity in Databases, Dagstuhl, Germany, 1996.Google Scholar
  12. [Mar94]
    V. M. Markowitz. Safe Referential Integrity and Null Constraint Structures in Relational Databases. Information Systems, 19(4):359–378, 1994.CrossRefGoogle Scholar
  13. [Prz88]
    T. C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 191–216. Morgan Kaufmann, 1988.Google Scholar
  14. [Rei96]
    J. Reinert. Ambiguity for Referential Integrity is Undecidable. In Constraint Databases and Applications, LNCS 1034, pp. 132–147. Springer, 1996.Google Scholar
  15. [VG93]
    A. Van Gelder. The Alternating Fixpoint of Logic Programs with Negation. Journal of Computer and System Sciences, 47(1):185–221, 1993.CrossRefMathSciNetGoogle Scholar
  16. [VGRS91]
    A. Van Gelder, K. Ross, and J. Schlipf. The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3):620–650, July 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Bertram LudÄscher
    • 1
  • Wolfgang May
    • 1
  1. 1.Institut für InformatikUniversitÄt FreiburgGermany

Personalised recommendations