Rules are objects too: A knowledge model for an active, object-oriented databasesystem
Lecture notes in computer science on Advances in object-oriented database systems
Deriving production rules for constraint maintenance
Proceedings of the sixteenth international conference on Very large databases
Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Modularization techniques for active rules design
ACM Transactions on Database Systems (TODS)
Decidability and undecidability results for the termination problem of active database rules
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Path Removing Technique for Detecting Trigger Termination
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Unrolling Cycles to Decide Trigger Termination
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
An Algebraic Approach to Rule Analysis in Expert Database Systems
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
RIDS '97 Proceedings of the Third International Workshop on Rules in Database Systems
Refined Termination Decision in Active Databases
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
Improving the Refined Triggering Graph Method for Active Rules Termination Analysis
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Event-triggered data and knowledge sharing among collaborating government organizations
dg.o '07 Proceedings of the 8th annual international conference on Digital government research: bridging disciplines & domains
| Hi-index | 0.00 |
This paper presents an algorithm for static termination analysis of active rules in a context of modular design. Several recent works have suggested proving termination by using the concept of triggering graph. We propose here an original approach, based on these works, and that allows to guarantee the termination of a set of rules, conceived by several designers, even when none of the designers knows the set of the active rules. We introduce the notions of private event and of public event, and we refine the notion of triggering graph (by enclosing also events in graphs). We replace then the notion of cycle (which is no more relevant in a context of modular design) by the notion of maximal private path preceding a rule. By means of these tools, we show that it is possible to prove termination of active rules modular sets.