Research on ordered Boolean expression matching with window
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 enha...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2007-01-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/74657924/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1841537483972542464 |
---|---|
author | CAO Jing1 LIU Yan-bing1 LIU Ping1 TAN Jian-long1 GUO Li1 |
author_facet | CAO Jing1 LIU Yan-bing1 LIU Ping1 TAN Jian-long1 GUO Li1 |
author_sort | CAO Jing1 |
collection | DOAJ |
description | 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<sub>O</sub>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. |
format | Article |
id | doaj-art-b31c3945ebc74cc39578f943b58bf9f4 |
institution | Kabale University |
issn | 1000-436X |
language | zho |
publishDate | 2007-01-01 |
publisher | Editorial Department of Journal on Communications |
record_format | Article |
series | Tongxin xuebao |
spelling | doaj-art-b31c3945ebc74cc39578f943b58bf9f42025-01-14T08:35:17ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2007-01-0112513074657924Research on ordered Boolean expression matching with windowCAO Jing1LIU Yan-bing1LIU Ping1TAN Jian-long1GUO Li1In 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<sub>O</sub>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.http://www.joconline.com.cn/zh/article/74657924/Boolean expression matchingordered Boolean expression matching with windowBitCountOWBE algo-rithm |
spellingShingle | CAO Jing1 LIU Yan-bing1 LIU Ping1 TAN Jian-long1 GUO Li1 Research on ordered Boolean expression matching with window Tongxin xuebao Boolean expression matching ordered Boolean expression matching with window BitCountOWBE algo-rithm |
title | Research on ordered Boolean expression matching with window |
title_full | Research on ordered Boolean expression matching with window |
title_fullStr | Research on ordered Boolean expression matching with window |
title_full_unstemmed | Research on ordered Boolean expression matching with window |
title_short | Research on ordered Boolean expression matching with window |
title_sort | research on ordered boolean expression matching with window |
topic | Boolean expression matching ordered Boolean expression matching with window BitCountOWBE algo-rithm |
url | http://www.joconline.com.cn/zh/article/74657924/ |
work_keys_str_mv | AT caojing1 researchonorderedbooleanexpressionmatchingwithwindow AT liuyanbing1 researchonorderedbooleanexpressionmatchingwithwindow AT liuping1 researchonorderedbooleanexpressionmatchingwithwindow AT tanjianlong1 researchonorderedbooleanexpressionmatchingwithwindow AT guoli1 researchonorderedbooleanexpressionmatchingwithwindow |