Journal of Software:2001.12(2):276-282

(吉林大学 计算机科学系, 吉林 长春 130023)
Relationship Graph and Termination Analysis for Active Rule Set
ZUO Wan-li,LIU Ju-hong,LIU Shu-fen
Chart / table
Similar Articles
Article :Browse 2668   Download 2663
Received:August 12, 1998    Revised:October 30, 1999
> 中文摘要: 终止性反映了主动数据库系统良好的行为特性.目前有关主动规则集终止性分析的主要依据是触发图和活化图,其分析结果是保守的.为表达一个规则的动作可能使另一规则的条件为假的事实,引入了惰化图(deactivationgraph),并与触发图和活化图相结合,定义了更为一般的关联图(relationshipgraph).同时,给出了基于关联图的主动规则集终止性静态分析算法,提高了终止性判定的准确性.
Abstract:Termination reflects desirable behavior property of active database systems. At present, termination analysis is based on triggering and activation graphs, the result of which is conservative. In this paper, “deactivation graph” is introduced to express the fact that one rule's action may falsify another rule's condition. In combination with triggering and activation graphs, a more generalized “relationship graph” is defined, based on which a new algorithm for termination analysis of active rule set is proposed, which improves the accuracy of termination analysis for active rule set.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金资助项目(69673015) 国家自然科学基金资助项目(69673015)
Foundation items:
Reference text:


ZUO Wan-li,LIU Ju-hong,LIU Shu-fen.Relationship Graph and Termination Analysis for Active Rule Set.Journal of Software,2001,12(2):276-282