Github user nishihatapalmer commented on the issue:
https://github.com/apache/incubator-metron/pull/541
Hi, byteseek author here. I notice you're using the standard
BoyerMooreHorspool searcher. Just to let you know that the
HorspoolFinalFlagSearcher offers much better performance than the standard
Horspool searcher - about 1.5 to 2 times faster in my tests - and uses no more
memory or pre-processing time.
It's essentially the same algorithm as Horpsool, but re-arranges it a bit
so that it only needs to verify a match when the algorithm detects that the
last character matches the pattern, which can be done using a negative shift
value (the "final flag"). Since verification is expensive to perform on each
loop iteration, this performs much better in general.
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
