Re: query optimization scenarios 17,701 times faster!!!

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: "Robert Dyas" <rdyas(at)adelphia(dot)net>
Cc: pgsql-hackers(at)postgresql(dot)org
Subject: Re: query optimization scenarios 17,701 times faster!!!
Date: 2003-04-24 02:59:50
Message-ID: 10365.1051153190@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-hackers

"Robert Dyas" <rdyas(at)adelphia(dot)net> writes:
> The following is a list of query pairs (one fast, one slow) that must
> produce identical results by definition (and do), but have very different
> execution times.

With no details about the table schemas, nor the EXPLAIN ANALYZE output
data, I really wonder how you expect any intelligent comments. We are
programmers, not mind-readers.

regards, tom lane

In response to

Responses

Browse pgsql-hackers by date

  From Date Subject
Next Message Sailesh Krishnamurthy 2003-04-24 05:49:20 Re: Are we losing momentum?
Previous Message Philip Warner 2003-04-24 01:37:23 Re: bit strings - anyone working on them?