An introductory walkthrough of hashing fundamentals and consistent hashing. Covers how hash tables work using key-value pairs, hash functions, and modulo operations, then explains hash collisions and how linked lists resolve them. The second half introduces consistent hashing (the hash ring), explaining why it outperforms traditional hashing in distributed systems where nodes can be added or removed without requiring a full remap of all keys. Real-world applications mentioned include load balancing, caching, and databases like Cassandra.
•19m watch time
11 Impressions