Performance assessment of dead-zone single keyword pattern matching

Authors:
Melanie Mauch;Derrick G. Kourie;Bruce W. Watson;Tinus Strauss
Affiliations:
University of Pretoria, South Africa;University of Pretoria, South Africa;University of Stellenbosch, South Africa;University of Pretoria, South Africa
Venue:
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Year:
2012

Citing 7
Cited 0

Text algorithms

Text algorithms
A fast string searching algorithm

Communications of the ACM
Guarded commands, nondeterminacy and formal derivation of programs

Communications of the ACM
Handbook of Exact String Matching Algorithms

Handbook of Exact String Matching Algorithms
Data Structures and Algorithms in Java

Data Structures and Algorithms in Java
A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

Science of Computer Programming
The Correctness-by-Construction Approach to Programming

The Correctness-by-Construction Approach to Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A so-called dead-zone pattern matching family of algorithms has previously been proposed as a concept. Here the performance of several instances of the family are empirically investigated. An abstract description of the algorithm family is given, as well as of these instances. This leads to a total of five different implementations of the algorithm. The time-performance of each of these implemented variants was then compared against those of the well-known Horspool and Boyer-Moore pattern matching algorithms, the latter being representative of the best-known pattern matchers currently available. Various data sets, pattern selections and pattern lengths were used, but the same Horspool-like shift tables were used throughout by the dead-zone variants. It was found that in some contexts variants of the dead zone algorithm compare very favourably against the Horspool and Boyer-Moore algorithms.