摘要
提出了布尔表达式匹配技术,给出了算法框架,在此框架上实现了2种常用的实现方式;为了进一步增加布尔表达式的描述功能,增加了定序和窗口2个限制条件,提出了BitCount_OWBE算法,通过理论分析和实验数据证明该算法在多数情况下仍然可以达到原先的性能,从而很好地解决了上万规模的复杂规则匹配问题。
In view of the difficulty of the complex rule matching problem, Boolean expression matching and a algorithm framework were proposed to solve it. Two popular methods above this framework were given. In addition, two parameters-ORDER and WINDOW- were added into Boolean expression matching in order to enhance the power of the expression rule. Then BitCount_OWBE algorithm was proposed under these two parameters. Test results indicated that Bit- Count-OWBE could resolve the complex rules matching problem on the scale of 10 000 with no performance decline in most cases.
出处
《通信学报》
EI
CSCD
北大核心
2007年第12期125-130,共6页
Journal on Communications
基金
国家重点基础研究发展计划("973"计划)基金资助项目(2007CB311100)~~
