Skip to main content

Improving Termination Analysis of Active Rules with Composite Events

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 2001)

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

Included in the following conference series:

  • 538 Accesses

Abstract

This article presents an algorithm for static analysis of termination of active rules with composite events. We refine the concept of triggering graph, including in the graph not only rules, but also events (primitive events and composite events). Our termination algorithm improves the previous termination algorithms, thanks to the notions of composite path and maximal order M path preceding a rule, replacing the classical notion of cycle. Both composite events and overall conditions of rules paths can be taken into account for rules termination analysis. So, much more termination situations can be detected by our algorithm, especially when active rules defined with conjunction events or sequence events are used.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  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. 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. 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. 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 

  5. 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 

  6. S. Chakravarthy, D. Mishra. Snoop: An Expressive Event Specification Language for Active Databases. In Data and Knowledge Engineering, 14, 1994.

    Google Scholar 

  7. 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, FRG, 1988.

    Google Scholar 

  8. 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, 1996.

    Google Scholar 

  9. 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 

  10. 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 

  11. 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 

  12. 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 

  13. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Couchot, A. (2001). Improving Termination Analysis of Active Rules with Composite Events. In: Mayr, H.C., Lazansky, J., Quirchmayr, G., Vogel, P. (eds) Database and Expert Systems Applications. DEXA 2001. Lecture Notes in Computer Science, vol 2113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44759-8_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-44759-8_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42527-4

  • Online ISBN: 978-3-540-44759-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics