Re: Proposed Query Planner TODO items

From: markw(at)osdl(dot)org
To: tgl(at)sss(dot)pgh(dot)pa(dot)us
Cc: josh(at)agliodbs(dot)com, pgsql-hackers(at)postgresql(dot)org, jenny zhang <jenny(at)osdl(dot)org>, Mary Edie Meredith <maryedie(at)osdl(dot)org>
Subject: Re: Proposed Query Planner TODO items
Date: 2004-01-05 16:17:02
Message-ID: 200401051617.i05GH5M14999@mail.osdl.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

On 5 Jan, Tom Lane wrote:
> Josh Berkus <josh(at)agliodbs(dot)com> writes:
>> 2) DEVELOP BETTER PLANS FOR "OR GROUP" QUERIES
>
>> Summary: Currently, queries with complex "or group" criteria get devolved by
>> the planner into canonical and-or filters resulting in very poor execution on
>> large data sets. We should find better ways of dealing with these queries,
>> for example UNIONing.
>
>> Description: While helping OSDL with their derivative TPC-R benchmark, we ran
>> into a query (#19) which took several hours to complete on PostgreSQL.
>
> I've made some progress on this over the last week or two. Would it be
> possible to retry that benchmark with CVS tip?

Yeah, no problem. We'll pull the code from CVS and give it a try.

Mark

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Ben Clewett 2004-01-05 17:15:06 UNSUBSCRIBE
Previous Message Marek Lewczuk 2004-01-05 16:16:05 Re: [HACKERS] Announce: Search PostgreSQL related resources