知识卡片
哈希环限制迁移范围
一致性哈希将键和服务器映射到同一环,键归属顺时针遇到的第一个节点。增加节点只接管其前驱与自身之间的范围,删除节点把原范围交给后继,避免取模方案的全局重映射。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 一致性哈希 · 查看原书依据
Server lookup To determine which server a key is stored on, we go clockwise from the key position on the ring until a server is found. Figure 5-7 explains this process. Going clockwise, key0 is stored on server 0; key1 is stored on server 1; key2 is stored on server 2 and key3 is stored on server 3. Add a server Using the logic described
参考来源
- 位置:《System Design Interview – An insiders guide, Second Edition》第05章《一致性哈希》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0012_split_002.html)
- 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。
- 原始内容:Server lookup To determine which server a key is stored on, we go clockwise from the key position on the ring until a server is found. Figure 5-7 explains this process. Going clockwise, key0 is stored on server 0; key1 is stored on server 1; key2 is stored on server 2 and key3 is stored on server 3. Add a server Using the logic described