Scott Marlowe <scott.marl...@gmail.com> writes:
> On Mon, Feb 23, 2009 at 6:24 PM, Farhan Husain <russ...@gmail.com> wrote:
> This sort here:
>> -> Sort (cost=565372.46..568084.16 rows=1084680 width=74) (actual
>> time=5410606.604..5410606.628 rows=31 loops=1)
>> Sort Key: a1.subj
>> Sort Method: quicksort Memory: 489474kB
>> -> Seq Scan on jena_g1t1_stmt a1 (cost=0.00..456639.59
>> rows=1084680 width=74) (actual time=0.043..44005.780 rows=3192000
>> loops=1)
> Seems to be the problem. There are a few things that seem odd, the
> first is that it estimates it will return 1M ros, but returns only 31.
> The other is that sorting 31 rows is taking 5410606 milliseconds.
Uh, no, it's sorting 3192000 rows --- look at the input scan. Evidently
only the first 31 of those rows are getting fetched out of the sort,
though.
regards, tom lane
--
Sent via pgsql-performance mailing list (pgsql-performance@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-performance
