Analysis of Active Database Rules Behavior Using Rewriting Logic

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.

[1]  Elena Baralis,et al.  Compile-Time and Runtime Analysis of Active Behaviors , 1998, IEEE Trans. Knowl. Data Eng..

[2]  José Meseguer,et al.  A logical theory of concurrent objects , 1990, OOPSLA/ECOOP '90.

[3]  Ian S. Thomas,et al.  OLAF: The GOAD Active Database Event/Rule Tracer , 1996, DEXA.

[4]  Susan Darling Urban,et al.  Conditional term rewriting as a formal basis for analysis of active database rules , 1994, Proceedings of IEEE International Workshop on Research Issues in Data Engineering: Active Databases Systems.

[5]  Danilo Montesi,et al.  A transaction transformation approach to active rule processing , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[6]  Yahia Rabih La logique de réécriture : un formalisme pour modéliser les bases de données actives , 1996, INFORSID.

[7]  Helge Behrends,et al.  Simulation-based debugging of active databases , 1994, Proceedings of IEEE International Workshop on Research Issues in Data Engineering: Active Databases Systems.

[8]  Jennifer Widom,et al.  Static analysis techniques for predicting the behavior of active database rules , 1995, TODS.

[9]  Mokrane Bouzeghoub,et al.  VITAL: A Visual Tool for Analysis of Rules Behaviour in Active Databases , 1995, Rules in Database Systems.

[10]  T. Fors Visualization of rule behaviour in active database , 1997 .

[11]  Angelika I. Kokkinaki,et al.  On Using Multiple Abstractions Models to Analyze Active Database Behavior , 1998, Issues and Applications of Database Technology.

[12]  Letizia Tanca,et al.  A structured approach for the definition of the semantics of active databases , 1995, TODS.

[13]  Elena Baralis,et al.  Improving Rule Analysis by Means of Triggering and Activation Graphs , 1995, Rules in Database Systems.

[14]  Jennifer Widom,et al.  An Algebraic Approach to Rule Analysis in Expert Database Systems , 1994, VLDB.

[15]  Norman W. Paton,et al.  Dimensions of Active Behaviour , 1993, Rules in Database Systems.

[16]  Susan Darling Urban,et al.  Refined triggering graphs: a logic-based approach to termination analysis in an active object-oriented database , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[17]  Sin Yeung Lee,et al.  A Path Removing Technique for Detecting Trigger Termination , 1998, EDBT.

[18]  Sharma Chakravarthy,et al.  A Visualization and Explanation Tool for Debugging ECA Rules in Active Databases , 1995, Rules in Database Systems.

[19]  Norman W. Paton,et al.  DEAR: a DEbugger for Active Rules in an object-oriented context , 1993, Rules in Database Systems.