| 定序窗口布尔表达式匹配技术研究 |
| |
| 引用本文： | 曹 京,刘燕兵,刘 萍,谭建龙,郭 莉.定序窗口布尔表达式匹配技术研究[J].通信学报,2007,28(12):125-130. |
| |
| 作者姓名： | 曹 京 刘燕兵 刘 萍 谭建龙 郭 莉 |
| |
| 作者单位： | 1. 中国科学院,计算技术研究所,北京,100080;中国科学院,研究生院,北京,100039
2. 中国科学院,计算技术研究所,北京,100080 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划) |
| |
| 摘 要： | 提出了布尔表达式匹配技术，给出了算法框架，在此框架上实现了2种常用的实现方式；为了进一步增加布尔表达式的描述功能，增加了定序和窗口2个限制条件，提出了BitCount_OWBE算法，通过理论分析和实验数据证明该算法在多数情况下仍然可以达到原先的性能，从而很好地解决了上万规模的复杂规则匹配问题。
|
| 关 键 词： | 布尔表达式匹配 定序窗口布尔表达式匹配 BitCount_OWBE算法 |
| 文章编号： | 1000-436X（2007）12-0125-06 |
| 收稿时间： | 2007-09-24 |
| 修稿时间： | 2007-12-03 |
Research on ordered Boolean expression matching with window |
| |
| CAO Jing,LIU Yan-bing,LIU Ping,TAN Jian-long,GUO Li.Research on ordered Boolean expression matching with window[J].Journal on Communications,2007,28(12):125-130. |
| |
| Authors: | CAO Jing LIU Yan-bing LIU Ping TAN Jian-long GUO Li |
| |
| Abstract: | 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. |
| |
| Keywords: | Boolean expression matching ordered Boolean expression matching with window BitCount_OWBE algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《通信学报》浏览原始摘要信息 |
| 点击此处可从《通信学报》下载免费的PDF全文 |
|
