[ I realise the discussion has left strxfrm(), but for the archives if nothing else ... ] Peter Eisentraut <[EMAIL PROTECTED]> 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 ---------------------------(end of broadcast)--------------------------- TIP 1: subscribe and unsubscribe commands go to [EMAIL PROTECTED]
- [HACKERS] Possible solution for LIKE optimization Peter Eisentraut
- Re: [HACKERS] Possible solution for LIKE optimizatio... Tom Lane
- Re: [HACKERS] Possible solution for LIKE optimizatio... Peter Eisentraut
- Re: [HACKERS] Possible solution for LIKE optimizatio... Tom Lane
- Re: [HACKERS] Possible solution for LIKE optimizatio... Hiroshi Inoue
- Re: [HACKERS] Possible solution for LIKE optimizatio... Tom Lane
- RE: [HACKERS] Possible solution for LIKE optimiz... Hiroshi Inoue
- Re: [HACKERS] Possible solution for LIKE optimizatio... Tom Lane
- Re: [HACKERS] Possible solution for LIKE optimizatio... Giles Lean
- Re: [HACKERS] Possible solution for LIKE optimizatio... Tom Lane
- Re: [HACKERS] Possible solution for LIKE optimiz... Oleg Bartunov
- Re: [HACKERS] Possible solution for LIKE optimizatio... Hiroshi Inoue