Oh, I had missed that the Galil rule gives Boyer-Moore linear worst case performance. This might mean that BM is always a better choice than KMP.
Maybe there are no matches? In any case, the strange thing here is that when you run a search after dropping caches, then you only get half your stated disk bandwidth. But when you run with cache, your search goes faster, which would *normally* suggest you were I/O bound before.
-
-
(But if you're I/O bound, then you should be saturating disk bandwidth.)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.