Hash tables have been around since the 1950s, and are an example of a key-value store where a hash function is used to generate the index for the data value based on the key itself.

Together, Krapivin (now a graduate student at the University of Cambridge), Farach-Colton (now at New York University) and Kuszmaul demonstrated in a January 2025 paper that this new hash table can ...

Making fast hash tables in programming, which don't cause collision trouble, is one of computing's holy grails. Facebook thinks it's created a good one.