X-Original-To: pgsql-performance-postgresql.org@localhost.postgresql.org Received: from localhost (unknown [200.46.204.144]) by svr1.postgresql.org (Postfix) with ESMTP id CCDB956588 for ; Wed, 9 Mar 2005 17:22:42 +0000 (GMT) Received: from svr1.postgresql.org ([200.46.204.71]) by localhost (av.hub.org [200.46.204.144]) (amavisd-new, port 10024) with ESMTP id 84364-09 for ; Wed, 9 Mar 2005 17:22:39 +0000 (GMT) Received: from flake.decibel.org (flake.decibel.org [67.100.216.10]) by svr1.postgresql.org (Postfix) with ESMTP id 3C448564CE for ; Wed, 9 Mar 2005 17:22:38 +0000 (GMT) Received: by flake.decibel.org (Postfix, from userid 1001) id 8EADD1C8F3; Wed, 9 Mar 2005 11:22:38 -0600 (CST) Date: Wed, 9 Mar 2005 11:22:38 -0600 From: "Jim C. Nasby" To: Rick Schumeyer , pgsql-performance@postgresql.org Subject: Re: index scan on =, but not < ? Message-ID: <20050309172238.GD528@decibel.org> References: <001f01c5240d$a920c8c0$0200a8c0@dell8200> <20050309043821.GA1569@wolff.to> <20050309045519.GA509@decibel.org> <20050309052020.GB1569@wolff.to> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline In-Reply-To: <20050309052020.GB1569@wolff.to> X-Operating-System: FreeBSD 4.11-RELEASE i386 X-Distributed: Join the Effort! http://www.distributed.net User-Agent: Mutt/1.5.6i X-Virus-Scanned: by amavisd-new at hub.org X-Spam-Status: No, hits=0.043 tagged_above=0 required=5 tests=AWL X-Spam-Level: X-Archive-Number: 200503/168 X-Sequence-Number: 10873 On Tue, Mar 08, 2005 at 11:20:20PM -0600, Bruno Wolff III wrote: > On Tue, Mar 08, 2005 at 22:55:19 -0600, > "Jim C. Nasby" wrote: > > 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%? > > No. When you are doing an index scan of a significant part of the table, > you will fetch some heap pages more than once. You will also be fetching > blocks out of order, so you will lose out on read ahead optimization > by the OS. This assumes that you don't get a lot of cache hits on the > help pages. If a significant portion of the table is cached, then the > trade off point will be at a higher percentage of the table. Ahh, I was thinking of a high correlation factor on the index. I still question 5% though... that seems awefully low. -- Jim C. Nasby, Database Consultant decibel@decibel.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?"