On Mon, 19 Nov 2001, Tille, Andreas wrote:
> On Fri, 16 Nov 2001, Thomas Lockhart wrote:
> > There is not much point in arguing a specific query case,
> It is no specific query case. It is the speed of an index scan which
> goes like N if you do it with PostgreSQL and it goes like log N if
> you do not have to look back into the table like MS SQL server does.
But it is in some way. It's dependant on the number of rows returned
by the query. For a small enough number of rows returned, having the
additional information in the index could very well make the query
slower even if it avoids the reads from the heap. Keeping the information
in some other fashion where it doesn't directly do that may alleviate
that, but it's not a straightforward one is better than the other in
all cases. It's not like postgres never uses an index on a large
table, it's just that after a certain amount of expected returns it
switches over.
