From mboxrd@z Thu Jan 1 00:00:00 1970 Received: (from majordomo@localhost) by pauillac.inria.fr (8.7.6/8.7.3) id OAA03002; Tue, 6 Nov 2001 14:03:19 +0100 (MET) X-Authentication-Warning: pauillac.inria.fr: majordomo set sender to owner-caml-list@pauillac.inria.fr using -f Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id OAA03589 for ; Tue, 6 Nov 2001 14:03:18 +0100 (MET) Received: from cantina.students.cs.unibo.it (cantina.students.cs.unibo.it [130.136.3.110]) by nez-perce.inria.fr (8.11.1/8.10.0) with ESMTP id fA6D3HD15584 for ; Tue, 6 Nov 2001 14:03:17 +0100 (MET) Received: from lordsoth.takhisis.org ([130.136.32.178]) (authenticated (0 bits)) by cantina.students.cs.unibo.it (8.12.0.Beta19/8.12.0.Beta19/Debian 8.12.0.Beta19) with ESMTP id fA6D3DtS023152 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=192 verify=FAIL) for ; Tue, 6 Nov 2001 14:03:16 +0100 Received: from lordsoth.takhisis.org (localhost [127.0.0.1]) by lordsoth.takhisis.org (8.12.0/8.12.0/Debian -3) with ESMTP id fA6D38JS010173 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=FAIL) for ; Tue, 6 Nov 2001 14:03:09 +0100 Received: (from zack@localhost) by lordsoth.takhisis.org (8.12.0/8.12.0/Debian -3) id fA6D38JL010171 for caml-list@inria.fr; Tue, 6 Nov 2001 14:03:08 +0100 Date: Tue, 6 Nov 2001 14:03:08 +0100 From: Stefano Zacchiroli To: caml-list@inria.fr Subject: Re: [Caml-list] b+tree Message-ID: <20011106140308.A10141@cs.unibo.it> Mail-Followup-To: caml-list@inria.fr References: <20011106120556.A2233@adept.co.za> <20011106132840.A12519@dpt-info.u-strasbg.fr> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Disposition: inline In-Reply-To: <20011106132840.A12519@dpt-info.u-strasbg.fr> User-Agent: Mutt/1.3.23i Sender: owner-caml-list@pauillac.inria.fr Precedence: bulk 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 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