What performance? Build a DDA out of the union of all the patterns and run it over each URL. Now you have O(1) (with low constant factors) matching no matter ho

What performance? Build a DDA out of the union of all the patterns and run it over each URL. Now you have O(1) (with low constant factors) matching no matter how many patterns you have. The DFA itself takes space and memory dereferences aren't free either, but even huge DFAs can be very compact.