Improving String Matching through Enhanced Hashing
Open Access
- 1 July 2026
- journal article
- Published by Wiley in Software: Practice and Experience
- Vol. 56 (11) , 1323-1333
Abstract
Background: Hashing offers opportunities to tune string matching algorithms while enabling efficient data retrieval and pattern detection. Many of the best algorithms apply hashing. Objective: We try to develop faster online algorithms for exact string matching. Methods: We present a set of refined hashing techniques and demonstrate their applicability by experiments. Results: Experiments on various data sets reveal significant improvements in search speed. Results: Our methods reduce computational overhead, enabling string matching algorithms to process larger datasets more efficiently and with better scalability.Keywords
This publication has 17 references indexed in Scilit:
- Practical Implementation of a Quantum String Matching Algorithm2024
- Searching long patterns with BNDMSoftware: Practice and Experience, 2024
- Fast and flexible packed string matchingJournal of Discrete Algorithms, 2014
- The exact online string matching problemACM Computing Surveys, 2013
- Improving practical exact string matchingInformation Processing Letters, 2010
- Fast exact string matching algorithmsInformation Processing Letters, 2007
- Fast and flexible string matching by combining bit-parallelism and suffix automataACM Journal of Experimental Algorithmics, 2000
- Speeding up two string-matching algorithmsAlgorithmica, 1994
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- Implementation of the substring test by hashingCommunications of the ACM, 1971