From: | Matthew Wakeling <matthew(at)flymine(dot)org> |
---|---|
To: | Eliot Gable <egable+pgsql-performance(at)gmail(dot)com> |
Cc: | pgsql-performance(at)postgresql(dot)org |
Subject: | Re: B-Heaps |
Date: | 2010-06-15 12:23:43 |
Message-ID: | alpine.DEB.2.00.1006151313370.4083@aragorn.flymine.org |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-performance |
On Mon, 14 Jun 2010, Eliot Gable wrote:
> Just curious if this would apply to PostgreSQL:
> http://queue.acm.org/detail.cfm?id=1814327
Absolutely, and I said in
http://archives.postgresql.org/pgsql-performance/2010-03/msg00272.php
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
systems.
Matthew
--
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
From | Date | Subject | |
---|---|---|---|
Next Message | Chris Browne | 2010-06-15 15:47:15 | Re: PostgreSQL as a local in-memory cache |
Previous Message | A. Kretschmer | 2010-06-15 06:49:29 | Re: B-Heaps |