| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> B+ tree implementation
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?
Thanks,
Daisy Received on Mon Jan 05 2004 - 22:26:56 CST
![]() |
![]() |