Bouma2: a high-performance input-aware multiple string-match algorithm

Authors:
Erez Buchnik
Affiliations:
European Research Centre of Huawei Technologies Co. Ltd., Munich, Germany
Venue:
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Year:
2011

Citing 13
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Accurate detection of very sparse sequence motifs

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
A String Matching Algorithm Fast on the Average

Proceedings of the 6th Colloquium, on Automata, Languages and Programming
cWINNOWER Algorithm for Finding Fuzzy DNA Motifs

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing
The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community

IBM Journal of Research and Development
Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Multipattern string matching with q-grams

Journal of Experimental Algorithmics (JEA)
FFPF: fairly fast packet filters

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
An improved DFA for fast regular expression matching

ACM SIGCOMM Computer Communication Review
Efficient regular expression evaluation: theory to practice

Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present Bouma2, a new algorithm for exact multiple string-match. It is highly parallelizable, has small footprint, and can be tuned using statistics of the input stream. It uses a special hashing technique to map the pattern-set to 2-symbol sequences, allowing the match procedure to be considerably optimized. This algorithm employs a fast-path/slow-path principle at match-time, which facilitates pipelining in H/W. We also produce experimental comparative results.