From: | Marti Raudsepp <marti(at)juffo(dot)org> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: Planner regression in 9.1: min(x) cannot use partial index with NOT NULL |
Date: | 2011-03-23 10:13:41 |
Message-ID: | AANLkTimyuz+NJPbXm6t6HDe-KSAP9zXvCd6WN-9x07nZ@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Tue, Mar 22, 2011 at 01:02, Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> wrote:
> I studied the code some more, and I think this probably can be made to
> work. The basic idea is to have preprocess_minmax_aggregates build
> simplified queries like the above (working by modifying the query tree
> that exists at the point where it's called) and call query_planner on
> them. Save aside the resulting path data, then let the regular planning
> process continue. When optimize_minmax_aggregates is called, see
> whether the regular plan is cheaper than the sum of the path costs.
> If not, use the paths to construct a replacement plan, same as now.
Thanks a lot! I can confirm that this is fixed now in git version, and
now also works with partitioned tables, which is great news.
Regards,
Marti
From | Date | Subject | |
---|---|---|---|
Next Message | Heikki Linnakangas | 2011-03-23 10:33:05 | Re: Replication server timeout patch |
Previous Message | Fujii Masao | 2011-03-23 08:53:14 | Re: Sync Rep v19 |