知识卡片

问题卡 · 4429

读写Quorum的相交条件

理解等级:中级

N 表示副本数,W 表示成功写需等待的确认数,R 表示读需收集的响应数。在固定的同一副本集合内,R 加 W 大于 N 保证读写集合相交;原文把相交直接称作强一致,取材仅保留可由集合关系证明的相交条件。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 键值存储 · 查看原书依据

      N = The number of replicas W = A write quorum of size W. For a write operation to be considered as successful, write operation must be acknowledged from W replicas. R = A read quorum of size R. For a read operation to be considered as successful, read operation must wait for responses from at least R replicas. Consider the following example shown in

    参考来源

    - 位置:《System Design Interview – An insiders guide, Second Edition》第06章《键值存储》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0015.html) - 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。 - 原始内容:N = The number of replicas W = A write quorum of size W. For a write operation to be considered as successful, write operation must be acknowledged from W replicas. R = A read quorum of size R. For a read operation to be considered as successful, read operation must wait for responses from at least R replicas. Consider the following example shown in