Scout Algorithm For Fast Substring Matching

TL;DR

The paper introduces Scout, a new straightforward substring matching algorithm that is efficient and suitable for all applications, outperforming existing methods in various performance aspects.

Contribution

Scout provides a simple, fast, and practical substring matching algorithm that is effective across different character sets, including Unicode, with comprehensive performance comparison.

Findings

Scout outperforms traditional algorithms in speed.

Scout is effective for Unicode and modern character sets.

Performance benchmarks show Scout's efficiency across applications.

Abstract

Exact substring matching is a common task in many software applications. Despite the existence of several algorithms for finding whether or not a pattern string is present in a target string, the most common implementation is a na\"ive, brute force approach. Alternative approaches either do not provide enough of a benefit for the added complexity, or are impractical for modern character sets, e.g., Unicode. We present a new algorithm, Scout, that is straightforward, quick and appropriate for all applications. We also compare the performance characteristics of the Scout algorithm with several others.