Advertisement

A theory for rule triggering systems

  • Yuli Zhou
  • Meichun Hsu
Session II: Rules
Part of the Lecture Notes in Computer Science book series (LNCS, volume 416)

Abstract

We define and study the family of RTS's, each appearing in the form of a relational database extended with a set of production-like rules with forward-chained operational semantics.

The syntax and operational semantics of RTS's are first defined, which provide a simple model for rule triggering systems. Operationally rules behave like concurrent processes which update the database's state. A computation of a RTS is then a sequence of states induced by firing rules in some order, which terminates in a fixed point. When a RTS has more than one rule, there may be multiple computations from the same state, and they may terminate in different fixed points.

The RTS's that have determinate computational behavior are identified as those computing unique fixed points. We give an easy-to-check sufficient condition that detects RTS's that may fail to belong to this class.

Keywords

Rule Base Transition Relation Operational Semantic Transition Sequence Horn Clause 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 References

  1. 1.
    J. A. Blakeley et al, Efficiently Updating Materialized Views. Proc. 1986 ACM SIGMOD Conference on Management of Data, 61–71.Google Scholar
  2. 2.
    P. Buneman, E. Clemons, Efficiently Monitoring Relational Databases. ACM Trans. on Database Systems vol. 4 No. 3 (Sept. 1979), 368–382.CrossRefGoogle Scholar
  3. 3.
    D. D. Chamberlain et al, SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control. IBM Journal of Research and Development, Vol. 20, No. 6 (November 1976).Google Scholar
  4. 4.
    D. Cohen, Automatic Compilation of Logical Specifications into Efficient Programs. In Proc. 5th National Conference on Artificial Intelligence, August 1986.Google Scholar
  5. 5.
    C. J. Date, An Introduction to Database Systems, Volume II. Addison-Wesley, Reading, Mass. 1983.Google Scholar
  6. 6.
    K. P. Eswaran. Specifications, Implementations, and Interactions of a Trigger Subsystem in an Integrated Data Base System. IBM Research Report RJ1820 (August 1976).Google Scholar
  7. 7.
    C. L. Forgy, Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelligence 19 (1982) 17–37.CrossRefGoogle Scholar
  8. 8.
    M. Hsu, R. Ladin and D. McCarthy, An Execution Model for Active Data Base Management Systems. Proc. 3rd International Conference on Data and Knowledge Bases, June 1988.Google Scholar
  9. 9.
    M. Hsu, T. E. Cheatham, Rule Execution in CPLEX: A Persistent Objectbase. Proc. 2nd International Workshop on Object Oriented Database Systems, September, 1988.Google Scholar
  10. 10.
    Gerard Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. JACM, Vol. 27, No. 4, 1980, 797–821.CrossRefGoogle Scholar
  11. 11.
    J. Moss, Nested Transactions: An Approach To Reliable Distributed Computing. MIT Laboratory for Computer Science, MIT/LCS/TR-260 (1981).Google Scholar
  12. 12.
    J. M. Nicolas, K. Yazdanian, Integrity Checking in Deductive Databases. In H. Gallaire, J. Minker (ed.) Logic and Data Bases, 325–344. Plenum Press, 1978.Google Scholar
  13. 13.
    D. A. Schmidt, Denotational Semantics: a Methodology for Language Development. Allyn and Bacon, Newton, Mass., 1986.Google Scholar
  14. 14.
    M. Stonebraker et al, A Rule Manager For Relational Database Systems. The POSTGRES Papers, Univ. of California, Berkeley, Ca. Electronics Research Lab, Memo No. UCB/ERL M86/85 (1986).Google Scholar
  15. 15.
    Sybase, Inc. Transact-SQL User's Guide. (1987).Google Scholar
  16. 16.
    Jeffrey. D. Ullman, Principles of Database Systems. 2nd ed., Computer Science Press, 1982.Google Scholar
  17. 17.
    M. H. Van Emden, R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language. J. ACM 23:4, 1976, 733–742.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Yuli Zhou
    • 1
  • Meichun Hsu
    • 1
  1. 1.Aiken Computation LaboratoryHarvard UniversityCambridge

Personalised recommendations