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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
