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

Why it was recommended

Excellent talk which explains the concepts really clearly and concisely.

Strong recommendationlalitmaganti · Original2026-07

What it 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. It is for someone who wants the derivation, proof, or implementation detail.

Video details

Channel

CppCon

Length

59 min 34 sec

Year

2017

More in this topic

• The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
• Modern Dictionaries by Raymond Hettinger
• CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
• CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
• Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019
• The Fastest Way to Board a Plane Feels Like the Slowest