Hi,

This is idle curiosity, I was looking through some papers I found on deferred 
balancing of btrees, with the idea of implementing it (for coldstore.)

The idea is that you only need to lock a couple of pages for update, and you 
come back later to rebalance the tree.

Someone suggested postgresql already does this.  Is it so?  If so, would 
someone give me a quick precis on the subject?

Colin.



Wed, 04 Aug 1999 01:58:23 +1000
Colin McCormack <colin@field.medicine.adelaide.edu.au>
Curiosity on deferred/delayed balancing btrees
> Hi,
> 
> This is idle curiosity, I was looking through some papers I found on deferred 
> balancing of btrees, with the idea of implementing it (for coldstore.)
> 
> The idea is that you only need to lock a couple of pages for update, and you 
> come back later to rebalance the tree.
> 
> Someone suggested postgresql already does this.  Is it so?  If so, would 
> someone give me a quick precis on the subject?

I think we do.  We have nbtree, whatever that is.

-- 
  Bruce Momjian                        |  http://www.op.net/~candle
  maillist@candle.pha.pa.us            |  (610) 853-3000
  +  If your life is a hard drive,     |  830 Blythe Avenue
  +  Christ can be your backup.        |  Drexel Hill, Pennsylvania 19026

Tue, 3 Aug 1999 12:19:42 -0400 (EDT)
Bruce Momjian <maillist@candle.pha.pa.us>
Re: [HACKERS] Curiosity on deferred/delayed balancing btrees