Re: Possible solution for LIKE optimization

From: Giles Lean <giles(at)nemeton(dot)com(dot)au>
To: Peter Eisentraut <peter_e(at)gmx(dot)net>
Cc: PostgreSQL Development <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Possible solution for LIKE optimization
Date: 2001-08-06 21:46:48
Message-ID: 1612.997134408@nemeton.com.au
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers


[ I realise the discussion has left strxfrm(), but for the archives
if nothing else ... ]

Peter Eisentraut <peter_e(at)gmx(dot)net> wrote:

> We'd need to implement the strxfrm() function in SQL and the $<=$
> operator, both of which are trivial. The index would have to be in terms
> of strxfrm(). There might be other issues, but they could be solved
> algorithmically, I suppose.

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.

Regards,

Giles

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Tom Lane 2001-08-06 22:21:48 Re: Possible solution for LIKE optimization
Previous Message Tom Lane 2001-08-06 21:33:01 Re: Notes about int8 sequences