Back to explore
Thumbnail for CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
HN score 12.0 · talk

Algorithms & data structures

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

CppCon · Discussed on HN from 2018 to 2026

Topics and ideas

  • 01swisstable
  • 02hash tables
  • 03c++

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.

Read the notes

Source context

Documented HN source

Hour-long look at modern open addressing hash tables

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

nwallin · 2019-10 · 9 recommenders across 10 months

Keep exploring

Thumbnail for 8 Bit & '8 Bitish' Graphics-Outside the Box
Game history & retro gamingtalk
Documented HN sourceHN 20.0
Quick Take

HN repeatedly recommends it as a master class in limited-palette pixel art and palette cycling, from an artist behind Loom and Monkey Island.