含环触发图对应的主动规则集可终止性分析.pdfVIP

计算机研究与发展 ISSN 1000-1239/CN 11-1777/TP Journal of Computer 且esearch and Developm巴~nt 42 (1 2): 2199-2205 , 2005 含环触发罔对应的主动规则集可终止性分析 都忠孝1 ， 3 ， 4 任超2 赵龄强1 J( 哈尔挂起理工大学计算机占3 控制学院 哈尔挂号 150080) (空军装备研究院航空气象研究所 4 室 北京 100085) 气齐齐哈尔火学计算机学院 齐齐阶尔 161006) (哈尔滨工业大学计算机科学与技术学院 哈尔滨 15000 1) (haozx@hrbust.oou.cn) Termination Analysis of Active Rnle ßased on Dependency 8et Hao Zhùngxìao ,3 ,4 , Ren Chao2 , and Zhao Lìngqìang 1 ( College 01 (Àmpuur and Control. Hω俨bin Unive叮叮y 01 Scienæ and T~町lwol.οgy ， Harbin 1500日。) Z (Fourth Laboratory of Seventh Res.阳rch Institute ofAir force , B们j ing 100085) 3 ( Ccllege 01 Com阳阳• Qiqihar University. Qiqihαy 161006) (αllege 0/ (ßmputer Scienæ and Technology , Harbin Inst巾1， οIfTec/川。/0反Y ， Harbin 15000 1) Abstract Termination of active rule set is one of the three Împortant characteristics of active database rule sets. It wìll directly influcncc thc appli正 atÎon of activc database SystCTUS. By analysis of dependency relationship , which exÎsts among the active rules , such concepts are given as triggering-transition closure , dependency-transition closure etc. ßased on these concepts , an approach is 削lPpo，_o;; ed to analyze termínation of actÌve rule set by triggerin日 dependency graph CT-DG) of actíve rules. Especìally , the approach decìding termination of the active rule set corresponding to a tríggerin阶graph (丁G) is studíed , whích íncludes a cyc1 e. Also given are the correspondîng decîding algorithms. verifícatíon and analysís of the algorithms. Key words active database; ECA rule; rule trìggering-dependency graph ,trígg旧ing-graph; terminatìon analysis 摘要主动规则集的叮终止性是主动数据库规则集的三大堂妥特征之一，主动规则集可1}保证终止 将直接影响辈U\ 统的应用.由于主动规则间存在依捕关系，通过对依锁关品的分析，给出了规则的触发 传递闭包、依赖传递闷包等概念.以此为基础，提出了用规则触发依赖图(丁-DC主)方法来分析主动规则 集的终止性.