Re: Optimizing a condition based on an a very unequally

From: Stephan Szabo <sszabo(at)megazone23(dot)bigpanda(dot)com>
To: Nick Fankhauser <nickf(at)ontko(dot)com>
Cc: pgsql-admin <pgsql-admin(at)postgresql(dot)org>
Subject: Re: Optimizing a condition based on an a very unequally
Date: 2002-03-13 19:42:05
Message-ID: 20020313113933.M85167-100000@megazone23.bigpanda.com
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-admin

On Wed, 13 Mar 2002, Nick Fankhauser wrote:

> So my question in general is why does PGSQL opt to use the index when
> looking for the single field row, and not use it when looking for the other
> 23768 rows?

Because in many cases the sequence scan will be faster than an index scan
when you're trying to get most of the rows of the table. Since the tuple
validity is in the table row and not the index, it's still got to check
the table which would involve lots of random reads into that file, so
you're doing even more disk operations and less efficient ones.

In response to

Responses

Browse pgsql-admin by date

  From Date Subject
Next Message Nick Fankhauser 2002-03-13 19:47:42 Re: Optimizing a condition based on an a very unequally distributed value.
Previous Message Herb Blacker 2002-03-13 19:21:00 Multi-threading