Proceedings Article10.1109/CIS.2014.136
An Improved Multi-pattern Matching Algorithm for Large-Scale Pattern Sets
Peng Zhan,Wang Yu-ping,Xue Jinfeng +2 more
- 15 Nov 2014
- pp 197-200
5
TL;DR: An improved multi-pattern matching algorithm based on the framework of the Wu-Manber (WM) algorithm is proposed to effectively deal with the large pattern sets and is shown to be efficient for large-scale pattern sets.
read more
Abstract: Multi-pattern matching algorithms are broadly used in many fields of computer science. However, the performance of the existing algorithms seriously degrades with the increasing of the number of patterns. In this paper, an improved multi-pattern matching algorithm based on the framework of the Wu-Manber (WM) algorithm is proposed to effectively deal with the large pattern sets. The WM algorithm is improved in two aspects. Firstly, the lengths of lists in the HASH table are balanced to reduce the number of candidate patterns, Secondly, a data structure called the "INDEX table" based on binary search is designed to reduce the time for finding candidate patterns. Experimental results show that our algorithm is efficient for large-scale pattern sets.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Fast Engine for Multi-String Pattern Matching
Zhan Peng,Yuping Wang,Wei Yue +2 more
TL;DR: Multi-string matching (MSM) is a core technique searching a text string for all occurrences of some string patterns, and as the number of string pattern...
2
A 100Gbps Multi-Pattern String Matching Method Based on Bloom filter and TCAM
Zhixiong Zhou,Sheng Wang +1 more
- 29 Mar 2024
TL;DR: This paper proposes a high-speed multi-pattern string matching method based on the combination of Bloom filters and TCAM, which uses a multi-hash Bloom filter for the first stage filtering, then executes precise matching for the second stage utilizing the high-speed parallel search capability of TCAM.
Short-rule-efficient rapid multi-pattern matching algorithm
Nian XIA,Tian SONG +1 more
TL;DR: A novel Modified Wu-Manber algorithm efficiently handles large, non-uniform pattern sets with variant lengths, improving performance by up to 40% compared to traditional algorithms, particularly for sets exceeding 100,000 patterns.
References
Fast Pattern Matching in Strings
TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
3.4K
Efficient string matching: an aid to bibliographic search
TL;DR: A simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text that has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.
A fast string searching algorithm
TL;DR: The algorithm has the unusual property that, in most cases, not all of the first i.” in another string, are inspected.
Address Filtering Based Wu-Manber Multiple Patterns Matching Algorithm
Baojun Zhang,Xiaoping Chen,Lingdi Ping,Zhaohui Wu +3 more
- 28 Oct 2009
TL;DR: Experimental result shows that the improved Wu-Manber algorithm has a good performance than the original one, and the address filtering based search method avoids traversing the whole link list.
17
TFD: A multi-pattern matching algorithm for large-scale URL filtering
Zhenlong Yuan,Baohua Yang,Xiaoqi Ren,Yibo Xue +3 more
- 28 Jan 2013
TL;DR: TFD employs Two-phase hash, Finite state machine and Double-array storage to eliminate the performance bottleneck of blacklist filter and achieves better performance than existing work in terms of matching speed, preprocessing time and memory usage.
14