Google B-Tree released
-
http://google-opensource.blogspot.in/2013/01/c-containers-that-save-memory-and-time.html
We’re pleased to announce C++ B-Tree, a C++ template library that implements B-tree containers with an analogous interface to the standard STL map, set, multimap, and multiset containers. B-trees are well-known data structures for organizing secondary storage, because they are optimized for reading and writing large blocks of data. But the same property that makes B-trees appropriate for use with databases and file systems also makes them appropriate for use in main-memory, just with smaller blocks.
C++ standard libraries commonly implement the map and set data structures using Red-Black trees, which store one element per node, requiring three pointers plus one bit of information per element to keep the tree balanced. By comparison, B-tree containers store a number of elements per node, thereby reducing pointer overhead and saving a significant amount of memory. For small data types, B-tree containers typically reduce memory use by 50 to 80% compared with Red-Black tree containers.
Hört sich doch gar nicht mal so schlecht an.
-
Hoffentlich wird das in den nächsten C++ Standard mit aufgenommen.
-
"Weise erdenken neue Gedanke, Narren verbreiten sie." Fuer alle, die es noch nicht wissen: isocpp.org.
-
Deine zynischen Kommentare sind hier nicht unerwünscht!