| From: | Greg Stark <gsstark(at)mit(dot)edu> |
|---|---|
| To: | Andrew Gierth <andrew(at)tao11(dot)riddles(dot)org(dot)uk> |
| Cc: | Hitoshi Harada <umi(dot)tanuki(at)gmail(dot)com>, pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Aggregate ORDER BY patch |
| Date: | 2009-11-16 00:17:51 |
| Message-ID: | 407d949e0911151617q3bcdc84cmd8e39833958ae231@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On Sun, Nov 15, 2009 at 11:23 PM, Andrew Gierth
<andrew(at)tao11(dot)riddles(dot)org(dot)uk> wrote:
> Future performance enhancements (which I have no particular plans to
> tackle) would involve having the planner consult the desired aggregate
> orderings and estimating the cost of sorting as opposed to the cost of
> producing a plan with the input already ordered. Also combining the
> sort step for aggregates that share a single ordering.
Those both seem like pretty important things. Do you have an idea how
to go about doing them?
--
greg
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Bruce Momjian | 2009-11-16 01:08:50 | Re: Patch committers |
| Previous Message | Roger Leigh | 2009-11-15 23:47:18 | Re: Unicode UTF-8 table formatting for psql text output |