Design and development of algorithms for identifying termination of triggers in active databases. (29th December 2011)

• Record Type: Journal Article
• Authors: Chezian, R. Manicka; Devi, T.
• Is Part Of: International journal of information systems and change management. Volume 5:Number 3(2011)
• Page Start: 251
• Page End: 266
• Publication Date: 2011-12-29
• Subjects: active rules -- triggers -- active databases -- termination -- triggering graph -- TG; Information resources management -- Periodicals; Organizational change -- Management -- Periodicals; 658.4038011
• Languages: English
• ISSNs: 1479-3121

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.