Re: B+ tree implementation

From: Corey Brown <corey_at_spectrumsoftware.net>
Date: Wed, 7 Jan 2004 12:06:01 -0500
Message-ID: <v_WKb.200$pk6.21@bignews6.bellsouth.net>

"Daisy Han" <xiaoding_han_at_yahoo.com> wrote in message news:7c848a86.0401061648.31c7dbcf_at_posting.google.com...
> Paul <paul_at_not.a.chance.ie> wrote in message
> >
> > I'm constantly amazed at the number of students who attend institutions
> > that have no libraries, but yet their students can find access to the
> > internet.
> >
> >
> > Go and get a book and read it, and if you still don't understand, or
> > need some finer pointers, then sure, come back here.
> >
> >
> I know there are a lot of implementations online and I actually
> downloaded a frew of them. Unfortunately, none of them deal with
> b+-tree swap-in/out of memory. That's why I posted here. Could you
> point some links/resource? I would apreciate that.

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.

Cheers
--Corey
>
> Thanks,
>
> Paul
Received on Wed Jan 07 2004 - 11:06:01 CST