@dataman thanks that was a really helpful link.
@araq I tested my simple hash algorithm against brute forth and BM with that smart tool. It always wins against brute forth. Against BM it wins always for pattern lengths under 16. Given that the BM has always an overhead for the first search I would use a heuristic with pattern under 16 or search text under 100 char.
