| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: B+ tree implementation
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?
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.
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 - 08:56:35 CST
![]() |
![]() |