Re: B+ tree implementation

Daisy Han wrote:

> 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?

When the data is too large to fit in memory, you store the data on disk instead. This tends to be used for persistent storage too, when the data has to last longer than a single program. There are many, many, many techniques for dealing with it. Google or Citeseer should be a great help.

-- 
Jonathan Leffler                   #include <disclaimer.h>
Email: jleffler_at_earthlink.net, jleffler_at_us.ibm.com
Guardian of DBD::Informix v2003.04 -- http://dbi.perl.org/