> The accesses to an index are far more likely to be clustered than the
> accesses to the underlying table, because the index is organized in a
> way that's application-meaningful and the table not so much.
So, to clarify, are you saying that if query were actually requesting
rows uniformly random, then there would be no reason to suspect that
index accesses would have hotspots? It seems like the index structure
( ie, the top node in b-trees ) could also get in the way.
In response to
pgsql-performance by date
|Next:||From: Dave Johansen||Date: 2011-05-16 19:38:12|
|Subject: Pushing LIMIT into sub-queries of a UNION ALL|
|Previous:||From: Jeff||Date: 2011-05-16 17:54:06|
|Subject: Re: Using pgiosim realistically|