Advertisement

Improving the Refined Triggering Graph Method for Active Rules Termination Analysis

  • Alain Couchot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2405)

Abstract

This article extends the Refined Triggering Graph Method for active rules termination analysis. The Refined Triggering Graph Method has been proposed to analyse active rules sets termination, in the context of object oriented databases. The RTG method exploits the notion of triggering formula. A triggering formula is a logic formula binding two rules. This logic formula captures the triggering link between a rule postcondition and a rule precondition. But only DB-independent atoms contained in rules postprecondition can be taken into account by the RTG analysis. We improve the RTG Method, taking into account the DB-dependent atoms contained in rules prepostconditions. To achieve this, we introduce the notion of descendant of a triggering formula and the notion of complex condition of a rule. The descendant of a triggering formula captures the transformations of an object, which satisfies the triggering formula, due to the rules actions. The complex condition of a rule captures the triggering link between a rule R and the rules which can trigger R. Many more termination situations can be detected, thanks to our improvement.

Keywords

Complex Condition Logic Formula Abstract Interpretation Active Rule Complex Order 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Aiken, J. Widom, J.M. Hellerstein. Behavior of Database Production Rules: Termination, Confluence and Observable Determinism. In Proc. Int’l Conf. on Management of Data (SIGMOD), San Diego, California, 1992.Google Scholar
  2. 2.
    J. Bailey, G. Dong, K. Ramamohanarao. Decidability and Undecidability Results for the Termination Problem of Active Database Rules. In Proc. ACM Symposium on Principles of Database Systems (PODS), Seattle, Washington, 1998.Google Scholar
  3. 3.
    E. Baralis, S. Ceri, S. Paraboschi. Improved Rule Analysis by Means of Triggering and Activation Graphs. In Proc. Int’l Workshop Rules in Database Systems (RIDS), Athens, Greece, 1995.Google Scholar
  4. 4.
    E. Baralis, S. Ceri, S. Paraboschi. Modularization Techniques for Active Rules Design. In ACM Transactions on Database Systems, (TODS), 21(1), 1996.Google Scholar
  5. 5.
    E. Baralis, S. Ceri, S. Paraboschi. Compile-Time and Run-Time Analysis of Active Behaviors. In IEEE Transactions on Knowledge and Data Engineering, 10(3), 1998.Google Scholar
  6. 6.
    J. Bailey, L. Crnogorac, K. Ramamohanarao, H. Søndergaard: Abstract Interpretation of Active Rules and its Use in Termination Analysis. In Proc. of the Int’l Conf. on Database Theory (ICDT’97), Delphi, Greece, 1997.Google Scholar
  7. 7.
    J. Bailey, A. Poulovassilis. An Abstract Interpretation Framework for Termination Analysis of Active Rules. In Proc. DataBase Programming Languages (DBPL’99), Kinloch-Rannoch, Scotland, 1999.Google Scholar
  8. 8.
    J. Bailey, A. Poulovassilis. Abstract Interpretation for Termination Analysis in Functional Active Databases. In Journal of Intelligent Information Systems, 12(2–3), 1999.Google Scholar
  9. 9.
    J. Bailey, A. Poulovassilis, P. Newson. A Dynamic Approach to Termination Analysis for Active Database Rules. In Proc. Int Conf. on Deductive Object Oriented Databases (DOOD 2000), London, UK, 2000.Google Scholar
  10. 10.
    E. Baralis, J. Widom. An Algebraic Approach to Rule Analysis in Expert Database Systems. In Proc. Int’l Conf. on Very Large Data Bases (VLDB), Santiago, Chile, 1994.Google Scholar
  11. 11.
    E. Baralis, J. Widom. An Algebraic Approach to Static Analysis of Active Database Rules. In ACM Transactions on Database Systems (TODS), 25(3), 2000.Google Scholar
  12. 12.
    S. Ceri, J. Widom. Deriving Production Rules for Constraint Maintenance. In Proc. Int’l Conf. on Very Large Data Bases (VLDB), Brisbane, Queensland, Australia, 1990.Google Scholar
  13. 13.
    S. Comai, L. Tanca. Using the Properties of Datalog to prove Termination and Confluence in Active Databases. In Proc. Int’l Workshop on Rules in Database Systems (RIDS), Skoevde, Sweden, 1997.Google Scholar
  14. 14.
    A. Couchot. Improving Termination Analysis of Active Rules with Composite Events. In Proc. Int’l Conf. on Database and Expert Systems Applications (DEXA), Munich, Germany, 2001.Google Scholar
  15. 15.
    A. Couchot. Termination Analysis of Active Rules Modular Sets. In Proc. Int’l Conf. on Information and Knowledge management (CIKM), Atlanta, Georgia, USA, 2001.Google Scholar
  16. 16.
    U. Dayal, A.P. Buchmann, D.R. Mc Carthy. Rules are Objects too: A Knowledge Model for an Active Object Oriented Database System. In Proc. Int’l Workshop on Object-Oriented Database Systems, Bad Münster am Stein-Ebernburg, Germany, 1988.Google Scholar
  17. 17.
    S. Debray, T. Hickey. Constraint-Based Termination Analysis for Cyclic Active Database Rules. In Proc. Int’l Conf. on Deductive Object Oriented Databases (DOOD). London, United Kingdom, 2000.Google Scholar
  18. 18.
    S. Flesca, S. Greco. Declarative Semantics for Active Rules. In Proc. Int’l Conf. on Database and Expert Systems Applications (DEXA), Vienna, Austria, 1998.Google Scholar
  19. 19.
    J.P. Jouannaud, C. Kirchner. Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification. In J.L. Lassez and G. Plotkin, editors. Computational Logic, pp. 257–321. MIT Press, 1991.Google Scholar
  20. 20.
    A.P. Karadimce, S.D. Urban. Conditional Term Rewriting as a Formal Basis for Analysis of Active Database Rules. In Proc. Int’l Workshop on Research Issues in Data Engineering (RIDE-ADS), Houston, Texas, USA, 1994.Google Scholar
  21. 21.
    A.P. Karadimce, S.D. Urban. Refined Triggering Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database. In Proc. Int’l Conf. on Data Engineering (ICDE), New-Orleans, Louisiana, USA, 1996.Google Scholar
  22. 22.
    S.Y. Lee, T.W. Ling. Refined Termination Decision in Active Databases. In Proc. Int’l Conf. on Database and Expert Systems Applications (DEXA), Toulouse, France, 1997.Google Scholar
  23. 23.
    S.Y. Lee, T.W. Ling. A Path Removing Technique for Detecting Trigger Termination. In Proc. Int’l Conf. on Extending Database Technology (EDBT), Valencia, Spain, 1998.Google Scholar
  24. 24.
    S.Y. Lee, T.W. Ling. Unrolling Cycle to Decide Trigger Termination. In Proc. Int’l Conf. on Very Large Data Bases (VLDB), Edinburgh, Scotland, 1999.Google Scholar
  25. 25.
    A. Martelli, U. Montanari. An Efficient Unification Algorithm. ACM Trans. on Programming Lang. and Syst., 4(2):258–282, 1982.zbMATHCrossRefGoogle Scholar
  26. 26.
    D. Rosenkrantz, H.B. Hunt. Processing Conjunctive Predicates and Queries. In Proc. Int’l Conf. on Very Large Data Bases (VLDB), Montréal, Canada, 1980.Google Scholar
  27. 27.
    G. Smolka. Feature-Constraint Logics for Unification Grammars. Journal of Logic Programming. 12:51–87, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  28. 28.
    M.K. Tschudi, S.D. Urban, S.W. Dietrich, A.P. Karadimce. An Implementation and Evaluation of the Refined Triggering Graph Method for Active Rule Termination Analysis. In Proc. Int’l Workshop on Rules in Database Systems, Skoevde, Sweden, 1997.Google Scholar
  29. 29.
    A. Vaduva, S. Gatziu, K.R. Dittrich. Investigating Termination in Active Database Systems with Expressive Rule Languages. In Proc. Int’l Workshop on Rules in Database Systems, Skoevde, Sweden, 1997.Google Scholar
  30. 30.
    T. Weik, A. Heuer. An Algorithm for the Analysis of Termination of Large Trigger Sets in an OODBMS. In Proc. Int’l Workshop on Active and Real-Time Databases. Skoevde, Sweden, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alain Couchot
    • 1
  1. 1.Laboratoire d’Informatique de Cergy-Pontoise, (LICP)France

Personalised recommendations