Design and development of algorithms for identifying termination of triggers in active databases Online publication date: Wed, 28-Dec-2011
by R. Manicka Chezian; T. Devi
International Journal of Information Systems and Change Management (IJISCM), Vol. 5, No. 3, 2011
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.
Online publication date: Wed, 28-Dec-2011
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information Systems and Change Management (IJISCM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com