Static analysis techniques for predicting the behavior of active database rules
ACM Transactions on Database Systems (TODS)
A structured approach for the definition of the semantics of active databases
ACM Transactions on Database Systems (TODS)
Visualization of rule behaviour in active database
Proceedings of the third IFIP WG2.6 working conference on Visual database systems 3 (VDB-3)
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
A Transaction Transformation Approach to Active Rule Processing
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
VITAL: A Visual Tool for Analysis of Rules Behaviour in Active Databases
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
Improving Rule Analysis by Means of Triggering and Activation Graphs
RIDS '95 Proceedings of the Second International Workshop on Rules in Database Systems
OLAF: The GOAD Active Database Event/Rule Tracer
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Integration of activity in object-oriented database systems, through the support of active rules, requires to guarantee certain properties such as termination and confluence. It is necessary in particular to be able to take into account various dimensions of the execution model since these dimensions directly influence termination and confluence. Few studies relating to termination and confluence consider these dimensions. In this paper, we suggest using a formalism based on the rewriting logic to describe an active object-oriented system. We show that the main dimensions of the active rule execution model can be expressed by adding three strategies: activate all the solutions of a subset, choice at more one solution of a subset, reiterate a solution as many times as possible. The problem is then to model the behaviour of a whole system. We suggest distributing the rules into strata. The interest of such a process is that the global strategy which models the behaviour of the system is the concatenation of the local strategies which model the behaviour of the different strata. Three different stratification algorithms are given. The analysis of termination and confluence then rests on the simulation of the global strategy.