On Mon, 14 Jun 2010, Eliot Gable wrote:
> Just curious if this would apply to PostgreSQL:
Absolutely, and I said in
but applied to the Postgres B-tree indexes instead of heaps. It's a pretty
obvious performance improvement really - the principle is that when you do
have to fetch a page from a slower medium, you may as well make it count
for a lot.
Lots of research has already been done on this - the paper linked above is
rather behind the times.
However, AFAIK, Postgres has not implemented this in any of its indexing
An ant doesn't have a lot of processing power available to it. I'm not trying
to be speciesist - I wouldn't want to detract you from such a wonderful
creature, but, well, there isn't a lot there, is there?
-- Computer Science Lecturer
In response to
- B-Heaps at 2010-06-15 03:21:30 from Eliot Gable
pgsql-performance by date
|Next:||From: Chris Browne||Date: 2010-06-15 15:47:15|
|Subject: Re: PostgreSQL as a local in-memory cache|
|Previous:||From: A. Kretschmer||Date: 2010-06-15 06:49:29|
|Subject: Re: B-Heaps|