High-speed discrete content sensitive pattern match algorithm for deep packet filtering

Author(s):  
Bo Jiang ◽  
Bin Liu
1995 ◽  
Vol 26 (1) ◽  
pp. 26-39
Author(s):  
Haruhiko Kimura ◽  
Shin-Ya Kobayashi ◽  
Tsuyoshi Takebe ◽  
Kazuyuki Sumiyoshi

2014 ◽  
Vol 513-517 ◽  
pp. 1507-1510 ◽  
Author(s):  
Si Li Li ◽  
Jin Zhu

XML query processing needs to search an XML document and return results that satisfy a request. In this paper, we proposed an effective pattern match algorithm based on structural index. This algorithm uses a suitable labeling scheme and an efficient structural index by identifying parent-child, ancestor-descendant and sibling relationships among nodes. Due to the algorithm avoids invalid immoderate results to be pushed stacks, So, It reduces the amount of joint and improves the performance of Query. Experiment results proved that our algorithm, TwigM performs about 15% better compared to TwigStack [ and 10% better than TwigINLAB[ for all types of queries.


2005 ◽  
Author(s):  
Da-qun Qian ◽  
Jian-ping Chen ◽  
Zhong-jun Zhang

Author(s):  
Felix Engelmann ◽  
Thomas Lukaseder ◽  
Benjamin Erb ◽  
Rens van der Heijden ◽  
Frank Kargl

Sign in / Sign up

Export Citation Format

Share Document