Re: More tablescanning fun

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: jim(at)nasby(dot)net
Cc: pgsql-performance(at)postgresql(dot)org
Subject: Re: More tablescanning fun
Date: 2003-04-24 23:58:30
Message-ID: 3660.1051228710@sss.pgh.pa.us
Views: Raw Message | Whole Thread | Download mbox | Resend email
Thread:
Lists: pgsql-performance

"Jim C. Nasby" <jim(at)nasby(dot)net> writes:
> It seems like the metrics used for the cost of index scanning v. table
> scanning on large tables need to be revisited. It might be such a huge
> difference in this case because the table is essentially clustered on
> the primary key.

Probably. What does the correlation figure in pg_stats show as?

There's been some previous debate about the equation used to correct
for correlation, which is certainly bogus (I picked it more or less
out of the air ;-)). But so far no one has proposed a replacement
equation with any better foundation ... take a look in
src/backend/optimizer/path/costsize.c if you want to get involved.

> Also, is there a TODO to impliment
> real clustered indexes?

No. It's not apparent to me how you could do that without abandoning
MVCC, which we're not likely to do.

regards, tom lane

In response to

Responses

Browse pgsql-performance by date

  From Date Subject
Next Message Jim C. Nasby 2003-04-25 04:59:24 Re: More tablescanning fun
Previous Message Jim C. Nasby 2003-04-24 23:38:17 More tablescanning fun