Writing a Very Fast Hash Table with Tiny Memory Footprints
Not to disgrace the author (it&#x27;s a good article), but I&#x27;ve spent a lot of time studying hashtable performance recently and I groan whenever I see benchmarks against libraries like std::unordered_map or libcuckoo. No shit your hash table performs better; it&#x27;s like claiming you&#x27;re good at running because you can beat a crippled child in a race.<p>For a test to be meaningful it needs to include comparisons to linear probing (both regular, robin-hood variants, and SSE variants), and other low-cost hash tables like coalesced hashing or separate chaining with a memory pool.<p>Speaking of robin hood hashing, pretty much all of the existing articles about it are missing some crucial facts about it. Don&#x27;t take what blog authors say for granted.