| From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
|---|---|
| To: | Josh Berkus <josh(at)agliodbs(dot)com> |
| Cc: | pgsql-hackers(at)postgresql(dot)org, Mark Wong <markw(at)osdl(dot)org> |
| Subject: | Re: Proposed Query Planner TODO items |
| Date: | 2004-01-05 16:00:30 |
| Message-ID: | 10185.1073318430@sss.pgh.pa.us |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
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?
regards, tom lane
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Eric Ridge | 2004-01-05 16:00:36 | Re: Postgres + Xapian (was Re: fulltext searching via a custom index type ) |
| Previous Message | Dave Cramer | 2004-01-05 15:51:34 | Re: [HACKERS] Announce: Search PostgreSQL related resources |