Re: B+ tree implementation
From: Paul <paul_at_not.a.chance.ie>
Date: Tue, 6 Jan 2004 14:56:35 -0000
Message-ID: <MPG.1a64dcfe26d5db55989889_at_news1.eircom.net>
Date: Tue, 6 Jan 2004 14:56:35 -0000
Message-ID: <MPG.1a64dcfe26d5db55989889_at_news1.eircom.net>
candy98_cn_at_yahoo.com says...
> I has this B+ tree implementation assignment at my database class. The
> most difficult part is how to deal with tree overgrow( the whole tree
> is too large to fit in memory). My question is what are
> techniques/strategies of handling the problem? Is there a traditional
> algorithm?
Paul...
> Daisy
-- 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.comReceived on Tue Jan 06 2004 - 15:56:35 CET