Re: [SQL] Usage of index in "ORDER BY" operations

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Matthias Ackermann <matt(at)webcraft(dot)ch>
Cc: pgsql-sql(at)hub(dot)org
Subject: Re: [SQL] Usage of index in "ORDER BY" operations
Date: 1999-11-27 17:18:02
Message-ID: 18588.943723082@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-sql

Matthias Ackermann <matt(at)webcraft(dot)ch> writes:
> So it seems that inserting a WHERE-clause, even if it doesn't do
> anything at all (i.e. doesn't reduce the result-set),
> is necessary to force the DB to make use of the index.

This is true in 6.5: it never even considers an indexscan plan unless
there is a WHERE clause that could make use of the index. 7.0 will
be smarter. (Current CVS sources already know about making an indexscan
plan with no other purpose than to satisfy an ORDER BY; in fact they are
probably *too* eager to make use of an index, and will pick that method
even when a linear scan and explicit sort would be faster. I need to
rejigger the cost estimates to be more realistic, especially by taking
LIMIT into account.)

regards, tom lane

Browse pgsql-sql by date

  From Date Subject
Next Message Andy Lewis 1999-11-27 18:25:55 Design Question
Previous Message Matthias Ackermann 1999-11-27 15:32:15 Usage of index in "ORDER BY" operations