← 返回卡片

原书出处

System Design Interview – An insiders guide, Second Edition

05 一致性哈希

Second Edition · 核验版本的摘录快照 · 导入于 2026-10-23T11:57:02.180Z

The rehashing problem If you have n cache servers, a common way to balance the load is to use the following hash method: serverIndex = hash(key) % N, where N is the size of the server pool. Let us use an example to illustrate how it works. As shown in Table 5-1, we have 4 servers and 8 string keys with their hashes. To fetch

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0012_split_001.html

EPUB SHA-256:ffc3a97753094acb30719f26589af322724b6c17c10371f0626e61687734b345