Design and development of algorithms for identifying termination of triggers in active databases

R. Manicka Chezian and T. Devi

International Journal of Information Systems and Change Management, 2011, vol. 5, issue 3, 251-266

Abstract: An active database system is a conventional database system extended with a facility for managing triggers (or active rules). Active database systems can react to the occurrence of some predefined events automatically. In many applications, active rules may interact in complex and sometimes unpredictable ways, thus possibly yielding infinite rule executions by triggering each other indefinitely causing non-termination. Almost all of the work to date on termination analysis for active databases relies on checking that a directed graph called the 'triggering graph' for a set of rules is acyclic. This paper presents new algorithms for detecting termination/non-termination of rule execution using triggering graph. These algorithms detect termination/non-termination among the rules in a triggering graph without any limitation on the number of rules.

Keywords: active rules; triggers; active databases; termination; triggering graphs. (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=44527 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijiscm:v:5:y:2011:i:3:p:251-266

Access Statistics for this article

More articles in International Journal of Information Systems and Change Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().