Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Abstract Interpretation for Termination Analysis in Functional Active Databases
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
An algebraic approach to static analysis of active database rules
ACM Transactions on Database Systems (TODS)
An event-condition-action language for XML
Proceedings of the 11th international conference on World Wide Web
Compile-Time and Runtime Analysis of Active Behaviors
IEEE Transactions on Knowledge and Data Engineering
Termination and Confluence by Rule Prioritization
IEEE Transactions on Knowledge and Data Engineering
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
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second 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
Active rules for XML: A new paradigm for E-services
The VLDB Journal — The International Journal on Very Large Data Bases
On the decidability of the termination problem of active database systems
Theoretical Computer Science
Automatic Control of Workflow Processes Using ECA Rules
IEEE Transactions on Knowledge and Data Engineering
Active rules termination analysis based on activation path and enhanced formula
International Journal of Intelligent Information and Database Systems
Hi-index | 0.00 |
Supporting active rules has become an important characteristic of modern database systems. While active rules termination is an undecidable problem, several recent works have suggested proving termination by using triggering and activation graphs. In this paper, we propose such concepts as activation reachable, activation path, inhibited activation cycle, inhibited activation rule, effective activation path to refine these works. Based on these concepts and the formula constructed for an effective activation path, we show how to determine the termination of active rules set. The analytical results prove that our approach can detect more termination situations than existing works. Moveover, the proposed approach is practical and general with respect to the various rule languages from Event-Condition-Action language for XML to the trigger language in SQL: 1999 standard. As a result, it can be easily applied to modern database systems.