Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
Modularization techniques for active rules design
ACM Transactions on Database Systems (TODS)
Eliminating costly redundant computations from SQL trigger executions
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
Algebraic change propagation for semijoin and outerjoin queries
ACM SIGMOD Record
Abstract Interpretation for Termination Analysis in Functional Active Databases
Journal of Intelligent Information Systems - Special issue on functional approach to intelligent information systems
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
An Improved Algorithm for the Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Compile-Time and Runtime Analysis of Active Behaviors
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
Using Delta Relations to Optimize Condition Evaluation in Active Databases
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Abstract Interpretation of Active Rules and its Use in Termination Analysis
ICDT '97 Proceedings of the 6th International Conference on Database Theory
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
Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
| Hi-index | 0.00 |
An important behavioural property for sets of active database rules is that of termination. In current commercial database systems, termination is guaranteed by imposing a fixed upper limit on the number of recursive rule firings that may occur. This can have undesirable effects such as prematurely halting correct executions. We describe a new approach based on a dynamic upper limit to the number of rule firings. This limit reflects knowledge about past rule behaviour on the database and provides a more accurate measure for when the DBMS should terminate rule execution. The approach incurs little cost and can easily be integrated with current techniques for static analysis of active rules.