基于活化路径和条件公式的主动规则集可终止性判定方法  

An Approach to Termination Decision for a Rule Set Based on Activation Path and Conditional Formula

作　　者：熊中敏[1] 郝忠孝[1,2,3] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院 [2]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001 [3]齐齐哈尔大学计算机与控制工程学院,齐齐哈尔161006

出　　处：《计算机研究与发展》2006年第5期901-907,共7页Journal of Computer Research and Development

基　　金：黑龙江省自然科学基金项目(F00-06)~~

摘　　要：支持主动规则机制已经成为现代数据库系统的一个重要特征.主动规则集的可终止性判定是主动数据库中一个核心问题之一,利用触发图和活化图的方法来判定可终止性都存在不同的保守性.为此,提出了为有效活化路径建立条件公式的思想,在此基础上给出了一个新的判定主动规则集可终止性的方法.分析的结果表明,提出的方法较现有方法可以发现更多的可终止性情形,最后给出了相应的算法及其可终止性、正确性证明.Supporting active rules has become an important characteristic of modern database systems. Active rules termination is an important problem of active database. To prove termination by using triggering and activation graphs has conservativeness. In order to refine the existing works, the formula constructed for an effective activation path is proposed in this paper and a novel approach about how to determine the termination of active rules set is presented. The analytical results prove that the proposed approach can detect more termination situations than any other existing works. Moveover, an algorithm for termination decision is provided, and its correctness and termination are proved.

关 键 词：主动数据库 规则分析 活化路径 条件公式 可终止性 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]