Skip to main content

Refined termination decision in active databases

  • Active and Temporal Aspects II
  • Conference paper
  • First Online:
Book cover Database and Expert Systems Applications (DEXA 1997)

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

Included in the following conference series:

Abstract

Termination decision in trigger systems is important to make sure that any rule execution does not result in an infinite loop. In general, it is an undecidable task. Several recent works have been proposed to prove termination under certain situations. However, most of the existing methods only make use of the trigger conditions. The influence of the trigger actions to the trigger conditions is hardly considered. Among the few methods which consider both trigger actions and trigger conditions, they are usually based on some restrictive assumptions, and their trigger architecture may be limited to only certain model. In this paper, we will investigate how the relationship between trigger actions and trigger conditions can be captured in a more general trigger model. We will first introduce the concepts of activator and deactivator. These capture the relationship between the trigger actions of one rule with the trigger condition of another rule. Based on these, we propose a refined method to detect more termination situations than previous works.

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

  1. A.Aiken, J.Widom and J.M.Hellerstein, “Behavior of database production rules: Termination, confluence, and observable determinism”, Proc ACM SIGMOD International Conf on the Management of Data, 59–68, 1992.

    Google Scholar 

  2. E.Baralis and J.Widom, “An Algebraic Approach to Rule Analysis in Expert Database Systems”, 20th VLDB Conf, 475–486, Sept 12–15, 1994.

    Google Scholar 

  3. E.Baralis, S.Ceri and S.Paraboschi, “Improved Rule Analysis by Means of Triggering and Activation Graphs”, RIDS'95, pg 165–181.

    Google Scholar 

  4. U.Dayal, “Active Database Systems”, Proc 3rd International Conf on Data and Knowledge Bases, Jerusalem Israel, June 1988.

    Google Scholar 

  5. A.P. Karadimce and S.D. Urban, “Conditional term rewriting as a formal basis for analysis of active database rules”, 4th International Workshop on Research Issues in Data Engineering (RIDE-ADS'94), February 1994.

    Google Scholar 

  6. A.P.Karadimce, S.D.Urban, “Refined Trigger Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database”, ICDE'96, pg 384–391.

    Google Scholar 

  7. M.Stonebraker, G.Kemnitz, “The POSTGRES Next-Generation Database Management System”, CACM, 34(10), 78–93, Oct 1991.

    Google Scholar 

  8. L.van der Voort and A. Siebes, “Termination and confluence of rule execution”, Proc 2nd International Conf on Information and Knowledge Management, Nov 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Abdelkader Hameurlain A Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, S.Y., Ling, T.W. (1997). Refined termination decision in active databases. In: Hameurlain, A., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1997. Lecture Notes in Computer Science, vol 1308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022030

Download citation

  • DOI: https://doi.org/10.1007/BFb0022030

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63478-2

  • Online ISBN: 978-3-540-69580-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics