Re: Optimizer seems to be way off, why?

Richard Huxton <dev@archonet.com>

From: Richard Huxton <dev@archonet.com>
To: Dirk Lutzebäck <lutzeb@aeccom.com>
Cc: pgsql-performance@postgresql.org
Date: 2005-07-20T17:01:41Z
Lists: pgsql-performance
Dirk Lutzebäck wrote:
> Hi,
> 
> I do not under stand the following explain output (pgsql 8.0.3):
> 
> explain analyze
> select b.e from b, d
> where b.r=516081780 and b.c=513652057 and b.e=d.e;
> 
>                                                         QUERY PLAN
> ---------------------------------------------------------------------------------------------------------------- 
> 
> Nested Loop  (cost=0.00..1220.09 rows=1 width=4) (actual 
> time=0.213..2926.845 rows=324503 loops=1)
>   ->  Index Scan using b_index on b  (cost=0.00..1199.12 rows=1 width=4) 
> (actual time=0.104..17.418 rows=3293 loops=1)
>         Index Cond: (r = 516081780::oid)
>         Filter: (c = 513652057::oid)
>   ->  Index Scan using d_e_index on d  (cost=0.00..19.22 rows=140 
> width=4) (actual time=0.009..0.380 rows=99 loops=3293)
>         Index Cond: ("outer".e = d.e)
> Total runtime: 3638.783 ms
> (7 rows)
> 
> Why is the rows estimate for b_index and the nested loop 1? It is 
> actually 3293 and 324503.

I'm guessing (and that's all it is) that b.r and b.c have a higher 
correlation than the planner is expecting. That is, it expects the 
b.c=... to reduce the number of matching rows much more than it is.

Try a query just on WHERE b.r=516081780 and see if it gets the estimate 
right for that.

If it's a common query, it might be worth an index on (r,c)

--
   Richard Huxton
   Archonet Ltd