Re: exponential time growth of handling subqueries

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Greg Stark <gsstark(at)mit(dot)edu>
Cc: pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: exponential time growth of handling subqueries
Date: 2003-10-13 23:50:58
Message-ID: 3632.1066089058@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

Greg Stark <gsstark(at)mit(dot)edu> writes:
> This is sort of interesting. It seems the time required for the optimizer to
> handle a query doubles with every layer of subquery it has to dig through.

Seems to be due to some brain fade in pull_up_subqueries --- the thing
was constructing truly monstrous rangetables due to poorly thought out
recursive modification of the parse tree :-(. Patch applied in CVS tip.

regards, tom lane

In response to

Browse pgsql-hackers by date

  From Date Subject
Next Message Mike Preece 2003-10-13 23:51:28 Re: Dreaming About Redesigning SQL
Previous Message Seth Ladd 2003-10-13 23:48:15 ways to force index use?