A path removing technique for detecting trigger termination

  • Sin Yeung Lee
  • Tok Wang Ling
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1377)


Termination decision in trigger systems is to ensure that any rule execution does not result in an infinite loop. Generally, this is an undecidable task. Several recent works have been proposed to prove termination under certain situations. However, most of these existing methods make use of the trigger conditions only in a limited way. In particular, overall conditions of long trigger sequences are not fully used to decide termination. In this paper, we will introduce the activation formula, which considers the overall conditions of long trigger sequences and hence covers many previous works. With this extension, traditional trigger edge elimination methods are no longer sufficient. We will then present a path elimination method called the node splitting method. Using this new approach, more termination situations than existing works can be detected.


Resultant Graph Execution Sequence Trigger Action Trigger System Trigger Condition 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    E.Baralis, S.Ceri and J.Widom, “Better Termination Analysis for Active Databases”, Proc of the 1st Int. Workshop on Rules in Database Syst., 163–179, 1993.Google Scholar
  3. [3]
    E.Baralis, S.Ceri and S.Paraboschi, “Improved Rule Analysis by Means of Triggering and Activation Graphs”, RIDS'95, 165–181.Google Scholar
  4. [4]
    E.Baralis, S.Ceri and S.Paraboschi, “Run-Time Detection of Non-Terminating Active Rule Systems”, DOOD, 38–54, 1995.Google Scholar
  5. [5]
    U.Dayal, “Active Database Systems”, Proc 3rd International Conf on Data and Knowledge Bases, Jerusalem Israel, Jun 1988.Google Scholar
  6. [6]
    O.Diaz, N.Paton and P.Gray, “Rule management in object-oriented databases: A uniform approach”, Proc 17th International Conf on VLDB, Barcelona, Spain, Sept 1991.Google Scholar
  7. [7]
    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), Feb 1994.Google Scholar
  8. [8]
    A.P.Karadimce, S.D.Urban, “Refined Trigger Graphs: A Logic-Based Approach to Termination Analysis in an Active Object-Oriented Database”, ICDE'96, 384–391.Google Scholar
  9. [9]
    S.Y.Lee, T.W.Ling, “Refined Termination Decision in Active Databases”, DEXA'97, 182–191, Sept 1997.Google Scholar
  10. [10]
    K.A.Ross, “Structural Totality and Constraints Stratification”, PODS, 184–185, 1995.Google Scholar
  11. [11]
    C.Zaniolo, “Active Database Rules with Transaction-Conscious Stable-Model Semantics”, DOOD'95, 55–72, Dec 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Sin Yeung Lee
    • 1
  • Tok Wang Ling
    • 1
  1. 1.Department of Information Systems and Computer ScienceNational University of SingaporeSingaporeSingapore

Personalised recommendations