| From: | "Luke Lonergan" <llonergan(at)greenplum(dot)com> |
|---|---|
| To: | "Christopher Kings-Lynne" <chriskl(at)familyhealth(dot)com(dot)au>, "Christopher Browne" <cbbrowne(at)acm(dot)org> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: Cost-based optimizers |
| Date: | 2005-12-13 05:31:20 |
| Message-ID: | BFC39CA8.1675F%llonergan@greenplum.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
Chris,
On 12/12/05 8:44 PM, "Christopher Kings-Lynne" <chriskl(at)familyhealth(dot)com(dot)au>
wrote:
> assumption of five. Thus, being able to correct mid-course is an area of
> enhancement for query optimizers that IBM is pursuing."
>
> Hmmm dynamic re-planning!
I recently interviewed someone who is in the research group working on this
at IBM. From what he said - it seems this is pretty far from making it's
way into the production codebase. Apparently there is too much history in
DB2's optimizer and the perception is that the risk / payoff is too high.
- Luke
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Josh Berkus | 2005-12-13 06:47:21 | Re: [HACKERS] Please Help: PostgreSQL Query Optimizer |
| Previous Message | Andreas Pflug | 2005-12-13 05:07:08 | Re: pg_relation_size locking |