Research on ordered Boolean expression matching with window

CAO Jing1; LIU Yan-bing1; LIU Ping1; TAN Jian-long1; GUO Li1

您当前的位置：

首页 >

文章列表页 >

Research on ordered Boolean expression matching with window

更新时间：2024-10-14

- Research on ordered Boolean expression matching with window
- Issue 12, Pages: 125-130(2007)
- 作者机构：
  
  1. 中国科学院计算技术研究所
  2. 中国科学院计算技术研究所,北京,100080
  3. 中国科学院研究生院
  4. ,北京,100039
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP301
- Published：2007
- 稿件说明：
移动端阅览
CAO Jing1, LIU Yan-bing1, LIU Ping1, et al. Research on ordered Boolean expression matching with window[J]. 2007, (12): 125-130.
DOI：

CAO Jing1, LIU Yan-bing1, LIU Ping1, et al. Research on ordered Boolean expression matching with window[J]. 2007, (12): 125-130. DOI：

摘要

提出了布尔表达式匹配技术

给出了算法框架

在此框架上实现了2种常用的实现方式;为了进一步增加布尔表达式的描述功能

增加了定序和窗口2个限制条件

提出了BitCount

WBE算法

通过理论分析和实验数据证明该算法在多数情况下仍然可以达到原先的性能

从而很好地解决了上万规模的复杂规则匹配问题。

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 parame-ters-ORDER and WINDOW-were added into Boolean expression matching in order to enhance the power of the expres-sion rule.Then BitCount

WBE 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

references

Views

708

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

AI问答

⁰