Frank DENIS random thoughts.

What's the fastest in-memory associative arrays library?

Using the maptest.cc benchmark :

(time for insert and for find) :

Tokyo Cabinet	: 0.40563	0.25999
STL map	: 2.63157	1.51657
STL multi map	: 2.54474	1.46864
STL set	: 2.34127	1.43893
GNU hash map	: 0.75396	0.48303
Google dense hash	: 0.74089	0.41089
Google sparse hash	: 2.06608	0.4709

The C++ standard library is clearly the big loser, regardless of the method.

Tokyo Cabinet just beats everyone.