Re: B+ tree implementation
Date: Thu, 8 Jan 2004 12:06:51 -0500
Message-ID: <83gLb.190$v16.63_at_bignews5.bellsouth.net>
"Paul" <paul_at_not.a.chance.ie> wrote in message
news:MPG.1a67879b85b3aa8f98988b_at_news1.eircom.net...
>
> corey_at_spectrumsoftware.net says...
>
> > Paul,
> > Take a look at Berkeley-DB (www.sleepycat.com). I believe the
sources
> > for that DB are still open source and they have a nice B-Tree
> > implementation that will solve your memory problem.
>
>
> Emmm... it was Daisy who was looking for the algorithms which are used
> when B+ trees exceed memory size IIRC.
Oops! My bad. Sorry.
>
>
> Paul...
>
>
> > --Corey
>
> --
> plinehan y_a_h_o_o and d_o_t com
> C++ Builder 5 SP1, Interbase 6.0.1.6 IBX 5.04 W2K Pro
> Please do not top-post.
>
> "XML avoids the fundamental question of what we should do,
> by focusing entirely on how we should do it."
>
> quote from http://www.metatorial.com
Received on Thu Jan 08 2004 - 18:06:51 CET