CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
CppCon · 6 位 HN 用户推荐 · 2019–2026
oblem isn't making lots of high density searches in a hash map, the problem is making a search every now and then. A hash map that makes three DRAM accesses will always be worse that one that makes one, regardless of how much work it needs to do, and this is for two reasons. First is there obvious: RAM is slow as balls, we get it. Second is more insidious. You just evicted two cache lines. It's no
— nwallin, 2019May I suggest you to have a look at Swiss Tables? There's a good talk from CppCon [0] that explains its design decisions, and implementations available as part of Abseil [1] and Rust stdlib [2]. [0] [link] [1] [link] [2] [link]
— vthriller, 2020Related: this talk [link] about the making of absl::flat_hash_map (a "competitor" to boost::unordered_flat_map) is one of my favorites.
— KerrickStaley, 2022In addition to this comment's siblings resources, I also suggest this really good Cppcon presentation on Swisstable [link]
— SkiFire13, 2025Have to plug the original Swiss Table talk by Matt Kulukundis: [link]
— lalitmaganti, 2026im surprised that go, a programming language also from google, wasn't using them! for an excellent talk on the development of swiss tables i highly recommend this talk by Matt Kulukundis at CppCon 2017: "Designing a fast, efficient, cache-friendly hash table, step by step" [link]
— nasso_dev, 2026