preprint · arXiv (Cornell University) · 2015

Multi-probe consistent hashing

Cited by 12Open access

Abstract

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.

Cite this paper

APA 7

Appleton, B., & O’Reilly, M. (2015). Multi-probe consistent hashing. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1505.00062

MLA 9

Appleton, Ben, and Michael O’Reilly. “Multi-probe consistent hashing.” arXiv (Cornell University), 2015, https://doi.org/10.48550/arxiv.1505.00062.

Chicago

Appleton, Ben, and Michael O’Reilly. 2015. “Multi-probe consistent hashing.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1505.00062.

Harvard

Appleton, B. and O’Reilly, M. (2015) ‘Multi-probe consistent hashing’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1505.00062.

BibTeX

@misc{appleton2015multi,
  title = {{Multi-probe consistent hashing}},
  author = {Appleton, Ben and O’Reilly, Michael},
  journal = {arXiv (Cornell University)},
  year = {2015},
  doi = {10.48550/arxiv.1505.00062}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.