pg.ddx.io  pgsql-performance@postgresql.org mailing list archive  
help / color / mirror / Atom feed
From: Tom Lane <tgl@sss.pgh.pa.us>
To: Colin McGuigan <cmcguigan@earthcomber.com>
Cc: pgsql-performance@postgresql.org
Subject: Re: Odd problem with planner choosing seq scan
Date: Sat, 21 Apr 2007 13:06:37 -0400
Message-ID: <25028.1177175197@sss.pgh.pa.us> (raw)
In-Reply-To: <462A2ED2.20501@earthcomber.com>
References: <462A2ED2.20501@earthcomber.com>

Colin McGuigan <cmcguigan@earthcomber.com> writes:
>   ->  Subquery Scan s  (cost=0.00..21.93 rows=1 width=8)
>         Filter: ((userid = 123456) AND (locationid IS NULL))
>         ->  Limit  (cost=0.00..15.30 rows=530 width=102)
>               ->  Seq Scan on staff  (cost=0.00..15.30 rows=530 width=102)

There does seem to be a bug here, but not the one you think: the rows=1
estimate for the subquery node seems a bit silly given that it knows
there are 530 rows in the underlying query.  I'm not sure how bright the
code is about finding stats for variables emitted by a subquery, but
even with totally default estimates it should not come up with a
selectivity of 1/500 for the filter.  Unfortunately, fixing that is
likely to bias it further away from the plan you want ...

> Furthermore, I can repeat this experiment over and over, so I know that 
> its not caching.

You mean it *is* caching.

> I'd really prefer this query run in < 1 second rather than > 45, but I'd 
> really like to do that without having hacks like adding in pointless 
> LIMIT clauses.

The right way to do it is to adjust the planner cost parameters.
The standard values of those are set on the assumption of
tables-much-bigger-than-memory, a situation in which the planner's
preferred plan probably would be the best.  What you are testing here
is most likely a situation in which the whole of both tables fits in
RAM.  If that pretty much describes your production situation too,
then you should decrease seq_page_cost and random_page_cost.  I find
setting them both to 0.1 produces estimates that are more nearly in
line with true costs for all-in-RAM situations.

(Pre-8.2, there's no seq_page_cost, so instead set random_page_cost
to 1 and inflate all the cpu_xxx cost constants by 10.)

			regards, tom lane



view thread (5+ messages)  latest in thread

Message-ID: <25028.1177175197@sss.pgh.pa.us>
Permalink:  ../25028.1177175197@sss.pgh.pa.us/
Also on:    postgresql.org/message-id/25028.1177175197@sss.pgh.pa.us

 · 

reply

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Reply to all the recipients using the --to and --cc options:
  reply via email

  To: pgsql-performance@postgresql.org
  Cc: tgl@sss.pgh.pa.us, cmcguigan@earthcomber.com
  Subject: Re: Odd problem with planner choosing seq scan
  In-Reply-To: <25028.1177175197@sss.pgh.pa.us>

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox