Research On The Termination Analysis Of Active Database Rules

Traditional database systems are passive in the sense that their state can only be changed as a result of outside influences or user programs. That is, querying and manipulating the data in traditional database systems must be performed with user intervention. In order to automatically maintain data integrity and coherence and process real-time information, an active database system enhance a traditional database system by providing the capability of automatically reacting to state changes without user intervention through active rules or triggers.Active database systems can monitor state changes inside or outside of database and make a response in time. Active rules have been efficiently applied in many lines such as industry controls, workflow processes, active data warehouse, and biologic information management. However, the possibility of infinite looping by active rules makes the termination decision of rules known as an undecidable problem. Termination is an important characteristic of active rules with desirable behaviors because non-termination will waste large amounts of system resource and worsen the system performance. And it will cause unrecoverable damage to some strictly controlled systems. Termination decision of active rules is a crucial problem that needs to be solved for design and application of active database. The existing approaches can only provide a sufficient condition to guarantee the termination of rules, how to efficiently detect a termination case is still a research task for the database study circle.The main aim of the research is to break the bottleneck of hard predicting the behavior of active rules and makes the executive semantics of active rules richer and more efficient through the study of termination theory of active rules. This also can directly push the application of active rules in much more areas.Firstly, a series of concepts are presented in this article to accurately depict...