Sorry that's bordering at nonsense hubris.
To take advantage of the index you need to identify character sequences in the regex.° (And erix even showed that it only works for 3+ characters in PG.)
Now, while it's possible to identify those sequences at the compile phase - at least in Perl using re - one need's to know which ones are
And regexes are Turing complete.
It might be possible with sufficient work involved, but I doubt it's already done.
You are more than welcome to prove me wrong. Even with a test/benchmark in PG.
Claiming that the complexity doesn't matter is really quite a bold statement.
Cheers Rolf
(addicted to the Perl Programming Language :)
see Wikisyntax for the Monastery
°) if they even appear in the regex!
In reply to Re^5: Documentation of REGEXP support in DBD::SQLite?
by LanX
in thread Documentation of REGEXP support in DBD::SQLite?
by ibm1620
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |