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
Snoop: an expressive event specification language for active databases
Data & Knowledge Engineering
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
Investigating Termination in Active Database Systems with Expressive Rule Languages
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
| Hi-index | 0.00 |
This article presents an algorithm for static analysis of termination of active rules with composite events. We refine the concept of triggering graph, including in the graph not only rules, but also events (primitive events and composite events). Our termination algorithm improves the previous termination algorithms, thanks to the notions of composite path and maximal order M path preceding a rule, replacing the classical notion of cycle. Both composite events and overall conditions of rules paths can be taken into account for rules termination analysis. So, much more termination situations can be detected by our algorithm, especially when active rules defined with conjunction events or sequence events are used.