| Random Link ¯\_(ツ)_/¯ | ||
| Nov 27, 2024 | » | Consistent Hashing
6 min; updated Nov 27, 2025
The term “consistent hashing” makes me think of hashing without randomization. Why isn’t every hash consistent by definition? For example, a map implementation would need consistent hashing lest it’s inaccurate when searching for stored values. Or is consistent hashing a tradeoff between collision-resistance and speed? Web Caching Web caching was the original motivation for consistent hashing. With a web cache, if a browser requests a URL that is not in the cache, the page is downloaded from the server, and the result is sent to both the browser and the cache.... |
| Sep 10, 2022 | » | [ToDo] CS 168: The Modern Algorithmic Toolbox
2 min; updated Sep 11, 2022
The Modern Algorithmic Toolbox (CS168). Gregory Valiant. web.stanford.edu . 2022. Accessed Sep 10, 2022. Modern Hashing Consistent hashing. Property-preserving lossy compression. From majority elements to approximate heavy hitters. From bloom filters to the count-min sketch. Data with Distances Similarity Search. (Dis)similarity metrics: Jaccard, Euclidean, Lp. Efficient algorithm for finding similar elements in small/medium (i.e. \(< 20\)) dimensions using k-d trees. Curse of Dimensionality, kissing number.... |