Re: query optimization

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Richard Kojedzinszky <krichy(at)tvnetwork(dot)hu>
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Re: query optimization
Date: 2012-04-26 19:17:18
Message-ID: 12228.1335467838@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

Richard Kojedzinszky <krichy(at)tvnetwork(dot)hu> writes:
> Dear list,
> We have a database schema, which looks the same as the attached script.

> When filling the tables with data, and skipping analyze on the table (so
> pg_stats contains no records for table 'a'), the first select in the
> script runs fast, but after an analyze the planner decides to sequence
> scan tables b and c, thus making the query much slower. Can somebody help
> me solving this issue, or tuning our installation to not to use sequence
> scans in this case?

Um ... did you analyze all the tables, or just some of them? I get
sub-millisecond runtimes if all four tables have been analyzed, but it
does seem to pick lousy plans if, say, only a and b have been analyzed.

What you really need for this query structure is the parameterized-path
work I've been doing for 9.2; but at least on the exact example given,
I'm not seeing that 9.1 is that much worse.

regards, tom lane

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Thomas Kellerer 2012-04-26 19:38:11 Re: query optimization
Previous Message Kevin Grittner 2012-04-26 18:23:38 Re: query optimization