Skip site navigation (1) Skip section navigation (2)

Re: B-Heaps

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 (view raw or flat)
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

In response to

  • B-Heaps at 2010-06-15 03:21:30 from Eliot Gable

Responses

pgsql-performance by date

Next:From: Chris BrowneDate: 2010-06-15 15:47:15
Subject: Re: PostgreSQL as a local in-memory cache
Previous:From: A. KretschmerDate: 2010-06-15 06:49:29
Subject: Re: B-Heaps

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group