Re: index scan on =, but not < ?

From: "Jim C(dot) Nasby" <decibel(at)decibel(dot)org>
To: Rick Schumeyer <rschumeyer(at)ieee(dot)org>, pgsql-performance(at)postgresql(dot)org
Subject: Re: index scan on =, but not < ?
Date: 2005-03-09 04:55:19
Message-ID: 20050309045519.GA509@decibel.org
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

On Tue, Mar 08, 2005 at 10:38:21PM -0600, Bruno Wolff III wrote:
> Not exactly. If the number of rows to be examined is on the order of 5%
> of the table, an index scan will probably be slower than a sequential
> scan. The visibility issue makes index scans slower in the case that

Shouldn't that be 50%?
--
Jim C. Nasby, Database Consultant decibel(at)decibel(dot)org
Give your computer some brain candy! www.distributed.net Team #1828

Windows: "Where do you want to go today?"
Linux: "Where do you want to go tomorrow?"
FreeBSD: "Are you guys coming, or what?"

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Bruno Wolff III 2005-03-09 05:20:20 Re: index scan on =, but not < ?
Previous Message Bruno Wolff III 2005-03-09 04:38:21 Re: index scan on =, but not < ?