arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.2294cs.DS
收藏

一种快速、最小内存、一致性哈希算法

A Fast, Minimal Memory, Consistent Hash Algorithm

John Lamping, Eric Veach

摘要:

我们提出了跳跃一致性哈希,一个快速,最小内存,一致性哈希算法,可以用大约5行代码表示。与Karger等人的算法相比,跳转一致哈希不需要存储,速度更快,并且在桶之间均匀划分键空间以及在桶数量变化时均匀划分工作负载方面做得更好。它的主要限制是桶必须按顺序编号,这使得它更适合数据存储应用程序,而不是分布式Web缓存。

英文摘要:

We present jump consistent hash, a fast, minimal memory, consistent hash algorithm that can be expressed in about 5 lines of code. In comparison to the algorithm of Karger et al., jump consistent hash requires no storage, is faster, and does a better job of evenly dividing the key space among the buckets and of evenly dividing the workload when the number of buckets changes. Its main limitation is that the buckets must be numbered sequentially, which makes it more suitable for data storage applications than for distributed web caching.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑