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)
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
A Structural Model of ECA Rules in Active Database
MICAI '02 Proceedings of the Second Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
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
Active rules for sensor databases
DMSN '04 Proceeedings of the 1st international workshop on Data management for sensor networks: in conjunction with VLDB 2004
Hi-index | 0.00 |
While active rules have been applied in many areas including active databases, XML documentation and Semantic Web, current methods remain largely uncertain of how to terminate active behaviors. Some existing methods have been provided in the form of a logical formula for a rule set, but they suffer two problems, (i) Only those variables, which are non-updatable or finitely updatable, can be contained by a formula. (ii) They cannot conclude termination if a rule set only contains some cycles that can be executed in a finite number of times. Many active rule systems, which only contain updatable variables, can still be terminated. This paper presents an algorithm to construct a formula, which can contain updatable variable. Also, a method is proposed to detect if a cycle can only be executed in a finite number of times. Theoretical analysis shows more termination cases, which is indetctive for existing methods, can be detected by our method.