| From: | Bruce Momjian <bruce(at)momjian(dot)us> |
|---|---|
| To: | Robert Haas <robertmhaas(at)gmail(dot)com> |
| Cc: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, 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 15:59:02 |
| Message-ID: | 20120208155902.GE24440@momjian.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Wed, Feb 08, 2012 at 10:17:36AM -0500, Robert Haas wrote:
> On Wed, Feb 8, 2012 at 9:51 AM, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
> > IMO this patch is already well past the point of diminishing returns in
> > value-per-byte-added. I'd like to see it trimmed back to provide a fast
> > path for just single-column int4/int8/float4/float8 sorts. The other
> > cases aren't going to offer enough of a win to justify the code space.
>
> I'm curious about how much we're gaining from the single-column
> specializations vs. the type-specific specializations. I think I'm
> going to go try to characterize that.
Yes, please. That would be a big help. Is there no optimization for
strings? I assume they are sorted a lot.
We can alway add more data types later.
--
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 | Bruce Momjian | 2012-02-08 16:13:57 | Re: pgstat documentation tables |
| Previous Message | Bruce Momjian | 2012-02-08 15:57:38 | Re: Progress on fast path sorting, btree index creation time |