Binomialhash A Constant Time Minimal Memory Consistent Hash Algorithm | Awesome Learning to Hash Add your paper to Learning2Hash

Binomialhash A Constant Time Minimal Memory Consistent Hash Algorithm

Coluzzi Massimo, Brocco Amos, Antonucci Alessandro. Arxiv 2024

[Paper]    
ARXIV

Consistent hashing is employed in distributed systems and networking applications to evenly and effectively distribute data across a cluster of nodes. This paper introduces BinomialHash, a consistent hashing algorithm that operates in constant time and requires minimal memory. We provide a detailed explanation of the algorithm, offer a pseudo-code implementation, and formally establish its strong theoretical guarantees.

Similar Work