16 Sep
2010
16 Sep
'10
1:40 p.m.
Zitat von Beman Dawes <bdawes@acm.org>:
http://idlebox.net/2007/stx-btree/stx-btree-0.8.3/doxygen-html/speedtest.htm...
Interesting. So someone has already done the work for drop in STL associative container replacements.
The timings only covered small trees. 16,000 was the number of elements mentioned. I'm testing with up to 100 million elements, and plan to expand that to a few billion elements.
here is a benchmark of various disk-based associative containers, including some B+Trees: http://fallabs.com/tokyocabinet/benchmark.pdf (performed by the author of tokyo cabinet)