Version française
Home     About     Download     Resources     Contact us    
Browse thread
[Caml-list] b+tree
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Stefano Zacchiroli <zack@c...>
Subject: Re: [Caml-list] b+tree
On Tue, Nov 06, 2001 at 01:28:40PM +0100, Sven wrote:
> On Tue, Nov 06, 2001 at 12:05:56PM +0200, Johann Spies wrote:
> > Are there any b+tree libraries available in ocaml?  Something like Aaron
> > Watters' bplustree for python?
> 
> Are those not the same as the balanced binary trees used by the set and map
> modules of the standard lib ?

Uhmm .. I doubt.

Balanced binary trees are binary search tree that keep almost balanced a
tree (like AVL or RB-tree), Btree and B+tree are data structures usually
used in DBMS, kept on disk and aimed to minimize the number of disk seek
(usually btree's leafs are sized based on disk block size).

Cheers.

-- 
Stefano "Zack" Zacchiroli <zack@cs.unibo.it> ICQ# 33538863
Home Page: http://www.cs.unibo.it/~zacchiro
Undergraduate student of Computer Science @ University of Bologna, Italy
                 - Information wants to be Open -
-------------------
Bug reports: http://caml.inria.fr/bin/caml-bugs  FAQ: http://caml.inria.fr/FAQ/
To unsubscribe, mail caml-list-request@inria.fr  Archives: http://caml.inria.fr