HashTrie:a space-efficient multiple string matching algorithm
The famous multiple string matching algorithm AC consumed huge memory when the string signatures were massive,thus unable to process high speed network traffic efficiently.To solve this problem,a space-efficient multiple string matching algorithm-HashTrie was proposed.This algorithm adopted recursiv...
Saved in:
Main Authors: | Ping ZHANG, Yan-bing LIU, Jing YU, Jian-long TAN |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2015-10-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015215/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
FilterFA: a multiple string matching algorithm based on specification of character set
by: Ping ZHANG, et al.
Published: (2016-12-01) -
Research on stochastic matrix mapping Hash for specific flow matching
by: TANG Hong, et al.
Published: (2007-01-01) -
The Structure of Bit-String Similarity Networks
by: David M. Schneider, et al.
Published: (2025-01-01) -
Research on ordered Boolean expression matching with window
by: CAO Jing1, et al.
Published: (2007-01-01) -
A byte-size multi-variable-length-code based string matching algorithm for Alpha image coding
by: Liping ZHAO, et al.
Published: (2018-11-01)