Skip to main content

An implementation and evaluation of the Refined Triggering Graph method for active rule termination analysis

  • Conference paper
  • First Online:
Rules in Database Systems (RIDS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1312))

Included in the following conference series:

Abstract

This paper describes the implementation of the Refined Triggering Graph (RTG) method for active rule termination analysis. The RTG method has been defined in the context of an active, deductive, object-oriented database language known as CDOL (Comprehensive, Declarative, Object Language). The RTG method studies the contents of rule pairs and rule cycles in a triggering graph and tests for: 1) the successful unification of one rule's action with another rule's triggering event, and 2) the satisfiability of active rule conditions, asking if it is possible for the condition of a triggered rule to evaluate to true in the context of the triggering rule's condition. If the analysis can provably demonstrate that one rule cannot trigger another rule, the directed vector connecting the two rules in a basic triggering graph can be removed, thus refining the triggering graph. Two important aspects in the implementation of the method include the development of a satisfiability algorithm for CDOL conditions and conditions and the extension of the RTG method with knowledge of the rule execution semantics. The effectiveness of the approach within the context of the sample application is also addressed.

This research was sponsored by NSF Grant No. IRI-9410983.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Aiden, A., Widom, J., and Hellerstein, J. M. 1992. Behavior of database production rules: Termination, confluence, and observable determinism. SIGMOD 21, 2 (Jun.), 59–68.

    Google Scholar 

  • Baralis, E., and Widom, J. 1994. An algebraic approach to rule analysis in expert database systems. In Proceedings of the Twentieth International Conference on Very Large Data Bases, (Santiago, Chile, Sep.), 475–486.

    Google Scholar 

  • Baralis, E., Ceri, S., and Paraboschi, S. 1995a. Improved rule analysis by means of triggering and activation graphs. In Rules in Database Systems: 2nd International Workshop, RIDS `95, (Glyfada, Athens, Greece, Sep. 25–27), 165–181.

    Google Scholar 

  • Baralis, E., Ceri, S., and Paraboschi, S. 1995b. Run-time detection of non-terminating active rule systems. In Deductive and Object-Oriented Databases, T. W. Ling, A. O. Mendelzon, and L. Vieille (editors), Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases DOOD `95, (Singapore, Dec. 4–7), 38–54.

    Google Scholar 

  • Baralis, E., Ceri, S., and Widom, J. 1993. Better termination analysis for active databases. In Proceedings of the First International Workshop on Rules in Database Systems, (Sep.), 163–179.

    Google Scholar 

  • Burkert, H.-J. 1991. A Resolution Principle for a Logic with Restricted Quantifiers. Springer-Verlag (LNCS 568).

    Google Scholar 

  • Ceri, S., and Widom, J. 1990. Deriving production rules for constraint maintenance. In IBM Research Report RJ 7348 (68829), IBM Research Division, Yorktown Heights, NY, (Mar. 1).

    Google Scholar 

  • Ceri, S., Baralls, E., Fraternali, P., and Paraboschi, S. 1995. Design of active rule applications: Issues and approaches. In Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases DOOD `95, (Singapore (Dec. 4–7),1–18.

    Google Scholar 

  • Ceri, S., Fraternali, P., Paraboschi, S., and Tanca, L. 1996. Active rule management in Chimera. In Active Database Systems: Triggers and Rules for Advanced Database Processing, J. Widom and S. Ceri (editors), Morgan Kaufmann, San Francisco, 151–176.

    Google Scholar 

  • Chan, R., Dietrich, S., and Urban, S. 1997. On Control Flow Testing of Active Rules in a Declarative Object-Oriented Framework, Rules in Database Systems Workshop, Skovde, Sweden, 1997.

    Google Scholar 

  • Fraternali, P., Paraboschi, S., and Tanca, L. 1992. Automatic rule generation for constraint enforcement in active databases. In Modelling Database Dynamics, U. W. Lipeck and B. Thalheim (editors), Springer-Verlag, London, 1993, Selected Papers from the Fourth International Workshop on Foundations of Models and Languages for Data and Objects, (Volkse, Germany, Oct. 19–22), 153–173.

    Google Scholar 

  • Jähne, A., Urban, S. D., and Dietrich, S. W. 1996. PEARD: A Prototype Environment for Active Rule Debugging. Journal of Intelligent Information Systems 7, 2 (Oct.), 111–128.

    Google Scholar 

  • Karadimce, A. P.1997. Termination and confluence analysis in an active object-oriented database. Ph.D. Dissertation, Department of Computer Science and Engineering, Arizona State University, Spring 1997.

    Google Scholar 

  • Karadimce, A. P., and Urban, S. D. 1996a. Proving termination of active rules in object-oriented databases. In Proceedings of the International Conference on Data Engineering, (New Orleans, LA, Feb.), pp. 384–391.

    Google Scholar 

  • Karadimce, A. P., and Urban, S. D. 1996b. Refined triggering graphs: A logic-based approach to termination analysis in an active object-oriented database. Submitted for journal publication.

    Google Scholar 

  • Montesi, D., and Torlone, R. 1995. A transaction transformation approach to active rule processing. In Proceedings of the Eleventh International Conference on Data Engineering, (Taipei, Taiwan, Mar. 6–10), 109–116.

    Google Scholar 

  • Rosenkrantz, D., and Hunt, H. B., III. 1980. Processing conjunctive predicates and queries. In Proceedings of the Sixth International Conference on Very Large Data Bases, (Montréal, Canada), 64–72.

    Google Scholar 

  • Tschudi, M. K. 1997. Static Analysis of Active Database Rules: Evaluating Tools for Termination Analysis, M.S. Thesis, Department of Computer Science and Engineering, Arizona State University, Spring 1997.

    Google Scholar 

  • Urban, S. D., Karadimce, A. P., Dietrich, S. W., Ben Abdellatif, T., and Chan, H. W. R. 1997. CDOL: A Comprehensive Declarative Object Language, Data & Knowledge Engineering, vol. 22, 1997, 67–111.

    Google Scholar 

  • Weik, T. and Heuer, A. 1995. An Algorithm for the Analysis of Termination of Large Trigger Sets in OODBMS, In Proceedings of the Workshop on Active and Real-Time Databases (ARTOB), 170–189.

    Google Scholar 

  • Widom, J. 1996. The Starburst rule system. In Active Database Systems: Triggers and Rules for Advanced Database Processing, J. Widom and S. Ceri (editors), Morgan Kaufmann, San Francisco, 87–109.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andreas Geppert Mikael Berndtsson

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tschudi, M.K., Urban, S.D., Dietrich, S.W., Karadimce, A.P. (1997). An implementation and evaluation of the Refined Triggering Graph method for active rule termination analysis. In: Geppert, A., Berndtsson, M. (eds) Rules in Database Systems. RIDS 1997. Lecture Notes in Computer Science, vol 1312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63516-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-63516-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63516-1

  • Online ISBN: 978-3-540-69588-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics