Re: index on large table

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Stephan Szabo <sszabo(at)megazone23(dot)bigpanda(dot)com>
Cc: Kacper Nowicki <kacper(dot)nowicki(at)wp(dot)pl>, PostgreSQL <pgsql-general(at)postgresql(dot)org>
Subject: Re: index on large table
Date: 2002-03-13 15:41:49
Message-ID: 8748.1016034109@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-general

>> "explain select * from events order by oid limit 10 offset 1000000"
>> NOTICE: QUERY PLAN:
>> Limit (cost=424863.54..424863.54 rows=10 width=130)
>> -> Sort (cost=424863.54..424863.54 rows=1025245 width=130)
>> -> Seq Scan on events (cost=0.00..35645.45 rows=1025245 width=130)
>>
>> Bummer. This is very slow again, sequential scan again. Why the index is
>> not used for this query? Use of index would make it very fast!

Not necessarily. Using the index for this would require fetching
1000000+10 values in the indexscan (and throwing away all but 10).

The planner is counting on its fingers and guessing that the sort
is faster. It might or might not be right about that (have you
compared timings?) but certainly the index method won't be
instantaneous.

regards, tom lane

In response to

Responses

Browse pgsql-general by date

  From Date Subject
Next Message Doug McNaught 2002-03-13 16:15:01 Re: indices
Previous Message Doug McNaught 2002-03-13 15:40:25 Re: vacuum with perl dbi / pg 7.1.3