An Efficient, Hybrid, Double-Hash StringMatching Algorithm

In this paper we show that combining some of the good features of the existing popular algorithms can be even more efficient. This new algorithm is hybrid as it employs features from Boyer-Moore-Horspool, Rabin-Karp and Raita algorithms. We compare the right most character as well as use two independent hash functions and no character by character checking - hence leaving a very small probability for a false positive result if there is any. The proposed algorithm particularly does well when the pattern is very long as it will skip checking character by character comparison.