Multi-probe consistent hashing

1 May 2015  ·  Ben Appleton, Michael O'Reilly ·

We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + epsilon with just 1 + 1/epsilon lookups per key.

PDF Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Categories

Data Structures and Algorithms E.2; E.1

Datasets

  Add Datasets introduced or used in this paper
Contact us on: hello@paperswithcode.com . Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Data policy Cookies policy