基于多槽分桶的快速规则冲突检测算法  

Fast Algorithm to Detect Conflict Rule Based on the Multi_Slot Sub_Bucket

作　　者：罗谦[1,2] 唐常杰[1] 郑皎凌[3] 胡建[4] 

机构地区：[1]四川大学计算机学院,成都610065 [2]中国民用航空总局第二研究所信息公司,成都610041 [3]成都信息工程学院软件工程系,成都610225 [4]中国西南电子设备研究所,成都610036

出　　处：《电子科技大学学报》2012年第3期447-452,共6页Journal of University of Electronic Science and Technology of China

基　　金：国家自然科学基金(60773169);中国民用航空局科研项目(MHRD200924)

摘　　要：为解决企业海量规则集合中产生的规则自我冲突问题,提出了基于多槽分桶的快速规则冲突检测算法MSSB。该算法利用同槽实桶之间规则两两必不冲突特性,将复杂的冲突规则求解转换为线性时间内的不冲突规则求解,从而在稳定的空间和时间复杂度下有效解决规则冲突发现问题。先形式化描述了通用规则冲突和不冲突,并在合理的假设条件下证明了3个规则间关系的命题和同槽不冲突定理;然后提出了基于哈夫曼树和三角矩阵结构的MSSB算法;最终在国内民航典型机场的规则集合上完成了对比实验,结果表明新算法的冲突检测性能比Policytree算法相提高了36.2%。To resolve the conflict within the massive rules in enterprise,this paper proposes a fast rule conflict-detection algorithm named multi_slot sub_bucket conflict cetection（MSSB） based on multi_slot and sub_bucket.It turns rule＇s complexity conflict detection into result of non-conflict rules in lineartime by the theorem of non-conflict.First,this research proposed the concepts of general rule＇s conflict and non-conflict,and proves three propositions and the theorem of non-conflict.Then it proposes the MSSB algorithm by the structure of Huffman tree and Triangular matrix.Extensive experiments over real data of Hub Airport show the effectiveness of new proposed MSSB algorithm.The average space complexity is decreased 33.6% and matching time is decreased 36.2% compared with traditional linear detection and policytree.

关 键 词：冲突检测 多槽 规则引擎 分桶 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]