B+ tree implementation
From: Daisy Han <candy98_cn_at_yahoo.com>
Date: 5 Jan 2004 20:26:56 -0800
Message-ID: <bd41fb59.0401052026.5846f94f_at_posting.google.com>
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?
Date: 5 Jan 2004 20:26:56 -0800
Message-ID: <bd41fb59.0401052026.5846f94f_at_posting.google.com>
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 Tue Jan 06 2004 - 05:26:56 CET