Zitat von Beman Dawes <bdawes@acm.org>:
A Boost B-tree library would provide disk-based associative containers that scale all the way from really, really, small to really, really, large. B-trees perform well on hardware ranging from ancient floppy disk drives all the way up to humongous disk arrays. They are the technology behind most high-performance disk file systems and databases.
If you don't know what a B-tree is, or think that "B-tree" is an abbreviation for "Binary tree", you might want to read the Wikipedia B-Tree article: http://en.wikipedia.org/wiki/B-tree. Knuth and other computer science texts also supply descriptions.
here`s a proposed library by bob walters that deals with large containers on disk: http://stldb.sourceforge.net/ I don`t think it implements a B-trees at this point (but some kind of tree, see trans_map), but aims to provide an infrastructure for any kind of tree or container.