Re: Multi-pass planner

From: Amit Kapila <amit(dot)kapila(at)huawei(dot)com>
To: "'Robert Haas'" <robertmhaas(at)gmail(dot)com>, "'Dimitri Fontaine'" <dimitri(at)2ndquadrant(dot)fr>
Cc: "'Greg Stark'" <stark(at)mit(dot)edu>, "'decibel'" <decibel(at)decibel(dot)org>, "'Josh Berkus'" <josh(at)agliodbs(dot)com>, "'Pg Hackers'" <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: Multi-pass planner
Date: 2013-04-05 04:43:05
Message-ID: 005001ce31b8$10b6c500$32244f00$@kapila@huawei.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On Friday, April 05, 2013 1:59 AM Robert Haas wrote:
> On Thu, Apr 4, 2013 at 2:53 PM, Dimitri Fontaine
> <dimitri(at)2ndquadrant(dot)fr> wrote:
> > Robert Haas <robertmhaas(at)gmail(dot)com> writes:
> >> for estimate_worstcase_fraction. So, when computing the cost of a
> >> path, we'd compute our current expected-case estimate, and also a
> >> worst-case estimate, and then compute the final cost as:
> >
> > There also was the idea for the executor to be able to handle
> alternate
> > plans and some heuristic to determine that the actual cost of running
> a
> > plan is much higher than what's been estimated, so much so as to
> switch
> > to starting from scratch with the other plan instead.
>
> Yeah. The thing is, if the plan has any side effects, that's not
> really an option. And even if it doesn't, it may throw away a lot of
> work.

Why to throw away all the work, it could as well try to repair the plan or
even if plan repair is not possible, it can keep multiple plans and
next time can try to choose best among available one's.

With Regards,
Amit Kapila.

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Brendan Jurd 2013-04-05 04:46:54 Re: [PATCH] Exorcise "zero-dimensional" arrays (Was: Re: Should array_length() Return NULL)
Previous Message Rodrigo Barboza 2013-04-05 04:29:38 Re: Why there is a PG_GETARG_UINT32 and PG_RETURN_UINT32?