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

CppCon189K subscribers

137,358 views

About this video

Hand-picked by a BrighterTube curator · found via HackerTube (Karpathy's dataset of videos Hacker News recommends · 91% confidence

A deep data-structures talk on a hash table now used widely (Abseil, Rust's hashbrown); clear diagrams and benchmarks.

Matt Kulukundis presents Google's SwissTable, explaining the SIMD-friendly open-addressing design that made it faster than std::unordered_map.

Video by CppCon, played through YouTube's embedded player.

Part of CppCon 2017