Behavior of database production rules: termination, confluence, and observable determinism
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Journal of Intelligent Information Systems
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
Detecting Termination of Active Database Rules Using Symbolic Model Checking
ADBIS '01 Proceedings of the 5th East European Conference on Advances in Databases and Information 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
Specifying active databases as non-Markovian theories of actions
Journal of Intelligent Information Systems
Refined rules termination analysis through activation path
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
While active rules have been applied in many areas including active databases, XML document and Semantic Web, current methods remain largely uncertain of how to detect the termination when analysing rules behaviours. Some methods are based on a logical formula for a rule set, but only those non-updatable or finitely updatable variables can be contained by a formula. Some other methods are based on triggering and activation graphs, but they do not consider whether all rules of a triggering cycle can be infinitely executed during a single cyclic execution. Most methods cannot conclude termination if a rule set contains only those cycles that can be executed for a finite number of times. This paper presents the concepts of activation path and the execution sequence of a triggering cycle as well as the method to construct a formula that is able to include updatable variables, and then many termination cases that cannot be determined by previous methods, can now be detected.