| From: | Simon Riggs <simon(at)2ndquadrant(dot)com> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Sort Refinement |
| Date: | 2008-03-20 23:07:19 |
| Message-ID: | 1206054439.4285.628.camel@ebony.site |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Thu, 2008-03-20 at 18:08 -0400, Tom Lane wrote:
> Simon Riggs <simon(at)2ndquadrant(dot)com> writes:
> > Currently, our sort algorithm assumes that its input is unsorted. So if
> > your data is sorted on (a) and you would like it to be sorted on (a,b)
> > then we need to perform the full sort of (a,b).
>
> Simon, would it be too much to ask that you concentrate on reviewing
> existing patches during commit fest? Trying to get people to think
> about random new ideas is about the most direct undermining of the
> commit-fest concept that I can think of. Save 'em for later.
That's a fair reminder, thanks, I will do that.
I have no wish at all to undermine things.
--
Simon Riggs
2ndQuadrant http://www.2ndQuadrant.com
PostgreSQL UK 2008 Conference: http://www.postgresql.org.uk
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Neil Conway | 2008-03-20 23:07:27 | Re: Integer datetimes |
| Previous Message | Alvaro Herrera | 2008-03-20 23:05:35 | Re: Integer datetimes |