Re: Possible solution for LIKE optimization

Giles Lean <giles@nemeton.com.au> writes:
> Implementations of strxfrm() that I've looked at have had result data
> that is three or four times larger than then input string -- quite a
> penalty in some situations.

Especially so given that we don't have TOAST for indexes, so the indexed
value can't exceed about 2700 bytes (for btree and an 8K block size).
You are allowed to compress first, so that's not a hard limit, but it
could still be a problem.

I like the non-locale-aware-opclass idea much better than the original.
        regards, tom lane