CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”

What this video covers

Matt Kulukundis explains how Google designed SwissTable, a fast, cache-friendly hash table, step by step from std::unordered_map. The talk covers open addressing, SIMD probing and the tradeoffs of changing a fundamental data structure.

Why it surfaced in Hacker News

HN repeatedly cites it as the definitive explanation of SwissTable, the design behind Abseil, Rust's hash map and Go's maps.

Recommendation context

Short excerpts from positive mentions. Open the source to read the full Hacker News discussion.

“(warning, it's an hour. Takes a while to build up, too. Still worth it.)”

“the talk on SwissTable [2] (Google's SIMD accelerated hash table) is excellent”

“is one of my favorites”