Skip site navigation (1) Skip section navigation (2)

Re: When are index scans used over seq scans?

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Richard van den Berg <richard(dot)vandenberg(at)trust-factory(dot)com>
Cc: pgsql-perform <pgsql-performance(at)postgresql(dot)org>
Subject: Re: When are index scans used over seq scans?
Date: 2005-04-20 14:39:21
Message-ID: 26710.1114007961@sss.pgh.pa.us (view raw or flat)
Thread:
Lists: pgsql-performance
Richard van den Berg <richard(dot)vandenberg(at)trust-factory(dot)com> writes:
> We have a table with 1M rows that contain sessions with a start and
> finish timestamps. When joining this table with a 10k table with rounded
> timestamps, explain shows me sequential scans are used, and the join
> takes about 6 hours (2s per seq scan on session table * 10000):

>  Nested Loop  (cost=252.80..233025873.16 rows=1035480320 width=97)
> Join Filter: (("outer".starttime <= "inner".ts) AND ("outer".finishtime
>> = "inner".ts))
>    ->  Seq Scan on sessions us  (cost=0.00..42548.36 rows=924536
> width=105)    ->  Materialize  (cost=252.80..353.60 rows=10080 width=8)
>          ->  Seq Scan on duration du  (cost=0.00..252.80 rows=10080 width=8)

The explain shows no such thing.  What is the *actual* runtime of
each plan per EXPLAIN ANALYZE, please?

(In general, any time you are complaining about planner misbehavior,
it is utterly pointless to give only planner estimates and not reality.
By definition, you don't think the estimates are right.)

			regards, tom lane

In response to

Responses

pgsql-performance by date

Next:From: William YuDate: 2005-04-20 15:09:37
Subject: Re: Opteron vs Xeon (Was: What to do with 6 disks?)
Previous:From: John A MeinelDate: 2005-04-20 14:34:56
Subject: Re: When are index scans used over seq scans?

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group