[Caml-list] b+tree

[Caml-list] b+tree

[Johann Spies]

Are there any b+tree libraries available in ocaml?  Something like Aaron
Watters' bplustree for python?

Johann
-- 
Johann Spies          Telefoon: 021-808 4036
Informasietegnologie, Universiteit van Stellenbosch

     "Let all that you do be done in love."   
                                      1 Corinthians 16:14 
-------------------
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

Re: [Caml-list] b+tree

[Sven]

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 ?

You might consider using patricia tree's which seem faster and have an ocaml
implementation (altough not debian packaged).

Friendly,

Sven Luther
-------------------
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

Re: [Caml-list] b+tree

[Stefano Zacchiroli]

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

Re: [Caml-list] b+tree

[scott]

I have implementend persistent btrees as part of a larger app.  I'd be
happy to share it with anyone interested,  but don't want to
distribute it yet as it's part of a larger domain-specific database
system that's not done.   The btree portion of this project is pretty
stable, though.

That said, mail me in private you'd like the code.

scott


On Tue, Nov 06, 2001 at 02:03:08PM +0100, Stefano Zacchiroli wrote:
> 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
-------------------
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