Static analysis techniques for predicting the behavior of active database rules
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 20 (1) , 3-41
- https://doi.org/10.1145/202106.202107
Abstract
This article gives methods for statically analyzing sets of active database rules to determine if the rules are (1) guaranteed to terminate, (2) guaranteed to produce a unique final database state, and (3) guaranteed to produce a unique stream of observable actions. If the analysis determines that one of these properties is not guaranteed, it isolates the rules responsible for the problem and determines criteria that, if satisfied, guarantee the property. The analysis methods are presented in the context of the Starburst Rule System .Keywords
This publication has 10 references indexed in Scilit:
- A new perspective on rule support for object-oriented databasesPublished by Association for Computing Machinery (ACM) ,1993
- An overview of production rules in database systemsThe Knowledge Engineering Review, 1993
- Behavior of database production rulesPublished by Association for Computing Machinery (ACM) ,1992
- Rule condition testing and action execution in ArielPublished by Association for Computing Machinery (ACM) ,1992
- Set-oriented production rules in relational database systemsPublished by Association for Computing Machinery (ACM) ,1990
- On rules, procedure, caching and views in data base systemsPublished by Association for Computing Machinery (ACM) ,1990
- Starburst mid-flight: as the dust clears (database project)IEEE Transactions on Knowledge and Data Engineering, 1990
- Safety of datalog queries over infinite databasesPublished by Association for Computing Machinery (ACM) ,1989
- A framework for testing safety and effective computability of extended datalogPublished by Association for Computing Machinery (ACM) ,1988
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980