| From: | Bruce Momjian <bruce(at)momjian(dot)us> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Robert Haas <robertmhaas(at)gmail(dot)com>, Peter Geoghegan <peter(at)2ndquadrant(dot)com>, Jay Levitt <jay(dot)levitt(at)gmail(dot)com>, Jim Decibel! Nasby <decibel(at)decibel(dot)org>, PG Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Progress on fast path sorting, btree index creation time |
| Date: | 2012-02-08 16:37:23 |
| Message-ID: | 20120208163723.GH24440@momjian.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Wed, Feb 08, 2012 at 11:35:46AM -0500, Tom Lane wrote:
> Bruce Momjian <bruce(at)momjian(dot)us> writes:
> > Yes, please. That would be a big help. Is there no optimization for
> > strings? I assume they are sorted a lot.
>
> It seems unlikely that it'd be worth including strings, especially if
> your locale is not C. This whole thing only makes sense for datatypes
> that are comparable in approximately 1 machine instruction.
Ah, OK, interesting.
--
Bruce Momjian <bruce(at)momjian(dot)us> http://momjian.us
EnterpriseDB http://enterprisedb.com
+ It's impossible for everything to be true. +
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Marti Raudsepp | 2012-02-08 16:47:58 | Re: Text-any concatenation volatility acting as optimization barrier |
| Previous Message | Tom Lane | 2012-02-08 16:35:46 | Re: Progress on fast path sorting, btree index creation time |