| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | "Guillaume Smet" <guillaume(dot)smet(at)gmail(dot)com> |
| Cc: | "Magnus Hagander" <magnus(at)hagander(dot)net>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first |
| Date: | 2007-05-04 18:49:53 |
| Message-ID: | 5616.1178304593@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-committers pgsql-hackers |
"Guillaume Smet" <guillaume(dot)smet(at)gmail(dot)com> writes:
> Is it possible to have something like Sort (disk|top-N|memory) instead
> of Sort?
That would be sane if the decision were fixed at plan time, but it isn't.
What do you think of the add-a-line approach?
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Stefan Kaltenbrunner | 2007-05-04 18:56:10 | Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first |
| Previous Message | Guillaume Smet | 2007-05-04 18:48:50 | Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Stefan Kaltenbrunner | 2007-05-04 18:56:10 | Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first |
| Previous Message | Guillaume Smet | 2007-05-04 18:48:50 | Re: [COMMITTERS] pgsql: Teach tuplesort.c about "top N" sorting, in which only the first |