A Study on Termination Analysis for Rule Compiler


The KIPS Transactions:PartD, Vol. 8, No. 6, pp. 823-834, Dec. 2001
10.3745/KIPSTD.2001.8.6.823,   PDF Download:

Abstract

In the active databases, whenever an event occurs, active rules with the matching event specifications are triggered automatically, its action will be executed. Because these rules may in turn trigger other rules including themselves, the set of rules may be executing each other indefinitely. These problem can be solved by rule termination analysis, and it is efficient for the rule termination to execute in compile time of rule. In this paper we not only design rule compiler with rule termination analyzer, but also propose its execution model and algorithm. The completeness of proposed model is verified by algorithm formalization of rule termination analysis.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
B. J. Jiang, J. H. Hwang, Y. H. Shin, K. H. Ryu, "A Study on Termination Analysis for Rule Compiler," The KIPS Transactions:PartD, vol. 8, no. 6, pp. 823-834, 2001. DOI: 10.3745/KIPSTD.2001.8.6.823.

[ACM Style]
Bing Ji Jiang, Jeong Hee Hwang, Ye Ho Shin, and Keun Ho Ryu. 2001. A Study on Termination Analysis for Rule Compiler. The KIPS Transactions:PartD, 8, 6, (2001), 823-834. DOI: 10.3745/KIPSTD.2001.8.6.823.