
15 Sep
2010
15 Sep
'10
11:39 p.m.
Den 15-09-2010 18:04, Beman Dawes skrev:
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.
Any interest?
Yes! Also, it would be useful to have a B-heap: http://queue.acm.org/detail.cfm?id=1814327 -Thorsten