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.
This work is supported in part by the US Department of Navy, Space and Naval Warfare Systems Command and Defense Advance Research Projects agency under contract N00038-88-@-0163, and the National Science Foundation under grant NSF-44-782-10-7687-2-30
Preview
Unable to display preview. Download preview PDF.
5 References
J. A. Blakeley et al, Efficiently Updating Materialized Views. Proc. 1986 ACM SIGMOD Conference on Management of Data, 61–71.
P. Buneman, E. Clemons, Efficiently Monitoring Relational Databases. ACM Trans. on Database Systems vol. 4 No. 3 (Sept. 1979), 368–382.
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).
D. Cohen, Automatic Compilation of Logical Specifications into Efficient Programs. In Proc. 5th National Conference on Artificial Intelligence, August 1986.
C. J. Date, An Introduction to Database Systems, Volume II. Addison-Wesley, Reading, Mass. 1983.
K. P. Eswaran. Specifications, Implementations, and Interactions of a Trigger Subsystem in an Integrated Data Base System. IBM Research Report RJ1820 (August 1976).
C. L. Forgy, Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelligence 19 (1982) 17–37.
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.
M. Hsu, T. E. Cheatham, Rule Execution in CPLEX: A Persistent Objectbase. Proc. 2nd International Workshop on Object Oriented Database Systems, September, 1988.
Gerard Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. JACM, Vol. 27, No. 4, 1980, 797–821.
J. Moss, Nested Transactions: An Approach To Reliable Distributed Computing. MIT Laboratory for Computer Science, MIT/LCS/TR-260 (1981).
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.
D. A. Schmidt, Denotational Semantics: a Methodology for Language Development. Allyn and Bacon, Newton, Mass., 1986.
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).
Sybase, Inc. Transact-SQL User's Guide. (1987).
Jeffrey. D. Ullman, Principles of Database Systems. 2nd ed., Computer Science Press, 1982.
M. H. Van Emden, R. A. Kowalski, The Semantics of Predicate Logic as a Programming Language. J. ACM 23:4, 1976, 733–742.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, Y., Hsu, M. (1990). A theory for rule triggering systems. In: Bancilhon, F., Thanos, C., Tsichritzis, D. (eds) Advances in Database Technology — EDBT '90. EDBT 1990. Lecture Notes in Computer Science, vol 416. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022186
Download citation
DOI: https://doi.org/10.1007/BFb0022186
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52291-1
Online ISBN: 978-3-540-46948-3
eBook Packages: Springer Book Archive