What we know about hashes
summary
Explains how hash tables (associative arrays) are used in industry, what their internal behavior and performance characteristics are, and sets realistic expectations for speed and memory use. Presents techniques and optimizations to understand and, when necessary, outperform standard C++ (and other) hash implementations.
AI-written summary · about
chapters (4)
related talks
01h 03m#Hashing (Hashing Values)
01h 05mImplementing Understandable World Class Hash Tables in C++
59mSo You Think You Can Hash
14mSEPH: Scalable, Efficient, and Predictable Hashing on Persistent Memory
55mSort vs Hash A Duality
59mA Hash Map for Graph Processing Workloads & a Methodology for Transactional Data Structures
24mWrite-Optimized Dynamic Hashing for Persistent Memory
55mIntroduction to C++ Containers - Know Your Data Structures