CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
CppCon · 9 HN recommendations
YouTube Summary
Less time searching through a video. More time understanding it. Paste a YouTube link for a complete summary, key ideas, and chapters you can revisit.
Open the YouTube Summary tool →Video Q&A
Ask AI to explain this scene or summarize the whole video. When an answer includes timestamps, select one to jump to that moment.
Try asking: What is the speaker explaining here?
Google sign-in is required. Review the maximum credit cost before confirming.
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 HN recommends it: HN repeatedly cites it as the definitive explanation of SwissTable, the design behind Abseil, Rust's hash map and Go's maps.
“Excellent talk which explains the concepts really clearly and concisely.” Read on HN ↗