Title: Design and development of algorithms for identifying termination of triggers in active databases
Authors: R. Manicka Chezian; T. Devi
Addresses: Department of Computer Science and Engineering, Bharathiar University, Coimbatore – 641 046, Tamil Nadu, India. ' Department of Computer Science and Engineering, Bharathiar University, Coimbatore – 641 046, Tamil Nadu, India
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.
International Journal of Information Systems and Change Management, 2011 Vol.5 No.3, pp.251 - 266
Available online: 28 Dec 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article