Fast Regular Expression Matching in a Large Static Text

We present a new method for regular expression matching in large static texts. The method maintains a search table T which stores the results of previous regular expression matches. A new regular expression match is answered first by using the results in T. This requires comparing the new regular expression to those in T. For the remaining part, the text is searched in a regular fashion, and T is updated. In our experiments, on average our method is more than 1,000 times faster that Grep, and 20 times faster than RunAutomaton. The speed up values in finding first results (response times) are even better.