Optimization: Hardcoded regular expressions are being compiled many times

[benjaminwinger]

Description

This query from ClickBench is heavily bottlenecked by our regex performance: MATCH (h:hits) WHERE h.Title =~ '.*Google.*' AND NOT h.URL =~ '.*\\.google\\..*' AND h.SearchPhrase <> '' RETURN h.SearchPhrase, MIN(h.URL), MIN(h.Title), COUNT(*) AS c, COUNT(DISTINCT h.UserID) ORDER BY c DESC LIMIT 10; (not that the original query uses a regex match, but we don't have a LIKE operator original sql query for reference).

See #4881 (comment): it takes 17s with the regex match compared to ~2.5s using contains instead.

Performance profiling shows that about 67% of the runtime is spent repeatedly compiling the regex (and a further 4% destroying the regex afterwards), despite it being the same each time.
Being able to compile the regex once and re-use it would speed things up significantly.