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.
Marino et al. (Wed,) studied this question.