Live briefing
Everything about Consistent hashing
Hashing technique
In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only keys need to be remapped on average where is the number of keys and is the number of slots. Consistent hashing evenly distributes cache keys across shards, even if some of the shards crash or become unavailable. In contrast, in most traditional hash tables, a change in the number of array slots causes nearly all keys to be remapped because the mapping between the keys and the slots is defined by a modular operation. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Consistent hashingA 5-minute orientation
- Skim a recent paper: Deep Semantic-Consistent Penalizing Hashing for Cross-Modal RetrievalInfluential work since 2022
- Pick up a classic book: No better timeThe most-reprinted book on the subject
- Read the landmark paper: Cycle-Consistent Deep Generative Hashing for Cross-Modal RetrievalCited 214 times
- Go sideways: Rendezvous hashingA closely related topic
- Go sideways: Distributed hash tableA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Cycle-Consistent Deep Generative Hashing for Cross-Modal Retrieval
Web caching with consistent hashing
Label Consistent Matrix Factorization Hashing for Large-Scale Cross-Modal Similarity Search
Spectral Hashing With Semantically Consistent Graph for Image Indexing
Asymmetric Supervised Consistent and Specific Hashing for Cross-Modal Retrieval
Label Consistent Flexible Matrix Factorization Hashing for Efficient Cross-modal Retrieval
Deep Cross-Modal Hashing Based on Semantic Consistent Ranking
Inductive Structure Consistent Hashing via Flexible Semantic Calibration
🆕 Influential since 2022
Deep Semantic-Consistent Penalizing Hashing for Cross-Modal Retrieval
A Cooperative Caching Scheme for VCCN With Mobility Prediction and Consistent Hashing
Cognitive multi-modal consistent hashing with flexible semantic transformation
Uncertainty-Aware and Multigranularity Consistent Constrained Model for Semi-Supervised Hashing
Label-consistent kernel transform learning-based sparse hashing for cross-modal retrieval
📚 Books worth reading
No better timeMolly Knight Raskin · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Rendezvous hashing Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a possible…
- Distributed hash table A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and…
- Kademlia Kademlia is a distributed hash table for decentralized peer-to-peer computer networks designed by Petar Maymounkov and David Mazières in 2002. It specifies…
- Chord (peer-to-peer) In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table. A distributed hash table stores key-value pairs by assigning…
- HAT-trie The HAT-trie is a type of radix trie that uses array nodes to collect individual key–value pairs under radix nodes and hash buckets into an associative…
- Approximate membership query filter Approximate membership query filters (hereafter, AMQ filters) comprise a group of space-efficient probabilistic data structures that support approximate…
- Koorde In peer-to-peer networks, Koorde is a distributed hash table (DHT) system based on the Chord DHT and the De Bruijn graph (De Bruijn sequence). Inheriting…
- Hash table In computer science, a hash table is a data structure that implements an associative array, also called a dictionary or simply map; an associative array…