DWMH: An Improved Algorithm Based on WM for Large-Scale Pattern Set

Xiao Ning Xu; Ai Ping Li; Jun Xing Zhu

doi:10.4028/www.scientific.net/AMR.765-767.963

Paper Titles

Study on Closed-Loop Coal Mine Hazard Information Management System Based on .NET
p.945

Design for the Township E-Government System Based on Wap and Web
p.950

Research on Layered Resource Discovery Model in Grid
p.955

The Algorithm of Network User Identification Based on Digitized Persona
p.959

DWMH: An Improved Algorithm Based on WM for Large-Scale Pattern Set
p.963

Zero-Copy Implementation in the Linux Operating System
p.968

Key Technologies of Cloud Computing Model
p.972

Text Extraction from Complex Background Images
p.975

WN-LEACH: A Weighted Residual Energy Based Cluster-Heads Selection Algorithm for Wireless Sensor Network
p.980

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 765-767DWMH: An Improved Algorithm Based on WM for...

DWMH: An Improved Algorithm Based on WM for Large-Scale Pattern Set

Abstract:

String matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both call for high speed string matching algorithm for large-scale pattern set. An improved algorithm based on WM algorithm for large-scale pattern set is proposed in this paper. The presented multiple pattern string matching algorithm, DWMH, which we call in brief, combines the idea of Horspool algorithm with WM algorithm and applies the method of double hash to revise WMs HASH table to achieve better performance. Our extensive experiments demonstrated that DWMH algorithm is more efficient than WM algorithm, particularly when the size of pattern set becomes large-scale.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 765-767)

Pages:

963-967

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.765-767.963

Citation:

Cite this paper

Online since:

September 2013

Authors:

Xiao Ning Xu, Ai Ping Li, Jun Xing Zhu

Keywords:

Algorithm (GA), Horspool, Multiple Patterns, String Matching, WM

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] A. v. Aho and M.J. Corasick, Efficient string matching：an aid to bibliographic search, Communication of the ACM, 18(6)：333-340, (1975).

DOI: 10.1145/360825.360855

Google Scholar

[2] Commentz-Walter B. A String Matching Algorithm Fast on the Average. Proc. 6th International Colloquium on Automata, Languages, and Programming, 1979: 118-132.

DOI: 10.1007/3-540-09510-1_10

Google Scholar

[3] Wu Sun and Udi Manber, A Fast Algorithm for Multi-pattern Searching, Technical Report, The Computer Science Department, The University of Arizona, (1994).

Google Scholar

[4] R.S. Boyer and J.S. Moore, A fast string searching algorithm., Comm. ACM20(10) 1977 762-772.

Google Scholar

[5] Horspool RN, Practial Fast Searching in String．Software—Practice and Experience, 1980, 10(6)：501·506p.

Google Scholar

[6] Sunday DM. A very fast substring search algorithm [J] Comtatlni-cations of ACM. 1990. 33(8): 132-142.

DOI: 10.1145/79173.79184

Google Scholar

[7] Brian Kernighan, Dennis Ritchie The C Programming Language, chapter6.

Google Scholar

[8] Kim S. A Fast Multiple String-Pattern Matching Algorithm[A]. 17th AoM/IAoM International Conference on Computer Science[C]. San Diego CA, August (1999).

Google Scholar