pg.ddx.io  pgsql-performance@postgresql.org mailing list archive  
help / color / mirror / Atom feed
From: Greg Stark <gsstark@mit.edu>
To: Tom Lane <tgl@sss.pgh.pa.us>
Cc: Greg Stark <gsstark@mit.edu>
Cc: Richard Huxton <dev@archonet.com>
Cc: David Brown <time@bigpond.net.au>
Cc: pgsql-performance@postgresql.org
Subject: Re: Seqscan rather than Index
Date: 17 Dec 2004 13:24:33 -0500
Message-ID: <87zn0cixzy.fsf@stark.xeocode.com> (raw)
In-Reply-To: <21110.1103305481@sss.pgh.pa.us>
References: <20041217011853.9E8FF3CADB0@svr1.postgresql.org>
	<41C2D936.3060901@archonet.com>
	<87acsdkjte.fsf@stark.xeocode.com>
	<21110.1103305481@sss.pgh.pa.us>

Tom Lane <tgl@sss.pgh.pa.us> writes:

> Greg Stark <gsstark@mit.edu> writes:
> > Postgres is also more pessimistic about the efficiency of index scans. It's
> > willing to use a sequential scan down to well below 5% selectivity when other
> > databases use the more traditional rule of thumb of 10%.
> 
> However, other databases are probably basing their analysis on a
> different execution model.  Since we have to visit both heap and index
> in all cases, we do indeed have a larger penalty for index use.

It's only in special cases that other databases do not have to look at the
heap. For simple queries like "select * from x where foo > ?" they still have
to look at the heap. I never looked into how much of a bonus Oracle gives for
the index-only case, I'm not sure it even takes it into account.

> I've looked pretty closely at the cost model for index access, believe me.
> It's not pessimistic; if anything it is undercharging for index access.

I think there's another effect here beyond the physical arithmetic. There's a
kind of teleological reasoning that goes something like "If the user created
the index chances are it's because he wanted it to be used".

I guess that argues more for more aggressive selectivity estimates than for
biased index costing though. If I'm doing "where foo > ?" then if there's an
index on foo I probably put it there for a reason and want it to be used even
if postgres doesn't really have a clue how selective the query will be.

> I think the one effect that's not being modeled is amortization of index
> fetches across successive queries.  

And across multiple fetches in a single query, such as with a nested loop.

It seems like the effective_cache_size parameter should be having some
influence here.

-- 
greg




view thread (16+ messages)  latest in thread

Message-ID: <87zn0cixzy.fsf@stark.xeocode.com>
Permalink:  ../87zn0cixzy.fsf@stark.xeocode.com/
Also on:    postgresql.org/message-id/87zn0cixzy.fsf@stark.xeocode.com

 · 

reply

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Reply to all the recipients using the --to and --cc options:
  reply via email

  To: pgsql-performance@postgresql.org
  Cc: gsstark@mit.edu, tgl@sss.pgh.pa.us, dev@archonet.com, time@bigpond.net.au
  Subject: Re: Seqscan rather than Index
  In-Reply-To: <87zn0cixzy.fsf@stark.xeocode.com>

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

This inbox is served by DDX for PostgreSQL; see mirroring instructions
for how to clone and mirror all data and code used for this inbox