PickVidsC++Now 2018: You Can Do Better than std::unordered_map: New Improvements to Hash Table Performance
推荐理由
Many videos on hash table are great. I found this one particularly good.
说明
这是2018年由CppNow发布的一部演讲，主题归在Software performance & optimization。它讲的是hash table performance这一支里的具体问题，而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成：Malte Skarupke's C++Now 2018 talk on hash table performance, explaining why std::unordered_map is slow and memory hungry and presenting faster designs, including his bytell hash map.这些读者给出的理由，核心是：Recommended as a thorough, well-regarded explanation of hash table design tradeoffs and why the standard container is a poor choice.讲法不绑某一条新闻，过几年仍然可以当材料看。从2021年到2024年，有2位不同的读者在2个不同月份把它推荐出来，其中明确叫别人去看的有0次。适合一次性看完。讲者把一个判断讲透，演示是在给这个判断配例子。如果已经会了基本定义，就把注意力放在它怎么把hash table performance变成能跟着复述的例子。
视频信息
- 频道
- CppNow
- 时长
- 1 小时 30 分
- 发布年份
- 2018
同主题更多
- How Python was Shaped by leaky Internals, Armin Ronacher, Flask framework
- CppCon 2015: Andrei Alexandrescu “std::allocator...”
- Preventing the Collapse of Civilization / Jonathan Blow (Thekla, Inc)
- "Performance Matters" by Emery Berger
- The Thirty Million Line Problem
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”