Tuning string matching for huge pattern sets

Authors:
Jari Kytöjoki;Leena Salmela;Jorma Tarhio
Affiliations:
Department of Computer Science and Engineering, Helsinki University of Technology, Finland;Department of Computer Science and Engineering, Helsinki University of Technology, Finland;Department of Computer Science and Engineering, Helsinki University of Technology, Finland
Venue:
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Year:
2003

Citing 13
Cited 4

Improved string searching

Software—Practice & Experience
A technique for two-dimensional pattern matching

Communications of the ACM - Special issue: multiprocessing
A new approach to text searching

Communications of the ACM
Text algorithms

Text algorithms
A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Fast and flexible string matching by combining bit-parallelism and suffix automata

Journal of Experimental Algorithmics (JEA)
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences

Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
A String Matching Algorithm Fast on the Average

Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Faster String Matching with Super-Alphabets

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Approximate Multiple Strings Search

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Fast Content-Based Packet Handling for Intrusion Detection

Fast Content-Based Packet Handling for Intrusion Detection
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing

LZgrep: a Boyer–Moore string matching tool for Ziv–Lempel compressed text: Research Articles

Software—Practice & Experience
Efficient String Matching in Huffman Compressed Texts

Fundamenta Informaticae
MDH: a high speed multi-phase dynamic hash string matching algorithm for large-scale pattern set

ICICS'07 Proceedings of the 9th international conference on Information and communications security
Efficient String Matching in Huffman Compressed Texts

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present three algorithms for exact string matching of multiple patterns. Our algorithms are filtering methods, which apply q- grams and bit parallelism. We ran extensive experiments with them and compared them with various versions of earlier algorithms, e.g. different trie implementations of the Aho-Corasick algorithm. Our algorithms showed to be substantially faster than earlier solutions for sets of 1,000- 100,000 patterns. The gain is due to the improved filtering efficiency caused by q-grams.