A hash table in programming is a collection that uses a hash function to map identifying values (keys) to their associated values.

- Stackoverflow.com Wiki
3 articles, 1 books. Go to books ↓

We introduce the idea of the Chord DHT from scratch, giving some intuition for the decisions made in the design of Chord.


Diving into the world of Hash Tables and understanding the underlying mechanics is extremely interesting, and very rewarding. So lets get into it and get started from the beginning.


Hash tables should not be prime number sized and they should not use an integer modulo to map hashes into slots. Fibonacci hashing is just better. Yet somehow nobody is using it and lots of big hash tables (including all the big implementations of std::unordered_map) are much slower than they should be because they don’t use Fibonacci Hashing. So let’s figure this out.