From: | Martijn van Oosterhout <kleptog(at)svana(dot)org> |
---|---|
To: | PFC <lists(at)peufeu(dot)com> |
Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, "pgsql-hackers(at)postgresql(dot)org" <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: More thoughts on sorting |
Date: | 2009-08-01 17:17:35 |
Message-ID: | 20090801171735.GE24672@svana.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Sat, Aug 01, 2009 at 09:37:11AM +0200, PFC wrote:
>> PFC <lists(at)peufeu(dot)com> writes:
>>> - for short strings (average 12 bytes), sort is CPU-bound in strcoll()
>>> - for longer strings (average 120 bytes), sort is even more CPU-bound in
>>> strcoll()
>>
>> No news there. If you are limited by the speed of text comparisons,
>> consider using C locale.
>>
> Actually, I think (see the bottom of my last email) that this would be a
> good argument for the per-column COLLATE patch...
Standard SQL COLLATE support is per column anyway, so just implementing
that will solve all the problems anyway.
Have a nice day,
--
Martijn van Oosterhout <kleptog(at)svana(dot)org> http://svana.org/kleptog/
> Please line up in a tree and maintain the heap invariant while
> boarding. Thank you for flying nlogn airlines.
From | Date | Subject | |
---|---|---|---|
Next Message | Kevin Field | 2009-08-01 18:30:26 | Re: 8.4 win32 shared memory patch |
Previous Message | Stephen Frost | 2009-08-01 13:52:30 | Re: SE-PostgreSQL Specifications |