知识卡片

问题卡 · 4427

分区时须明确一致性取舍

理解等级:高级

网络分区使副本不能及时交换更新;继续接受独立读写可能暴露旧值或冲突,拒绝无法安全处理的请求则牺牲部分可用性。CAP 应结合分区情境讨论,不能把它简化成所有时刻任意三选二。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

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

      Distributed key-value store A distributed key-value store is also called a distributed hash table, which distributes key-value pairs across many servers. When designing a distributed system, it is important to understand CAP (Consistency, Availability, Partition Tolerance) theorem. CAP theorem CAP theorem states it is impossible for a distributed system to simultaneously provide more than two of these three guarantees: consistency, availability, and partition tolerance. Let

    参考来源

    - 位置:《System Design Interview – An insiders guide, Second Edition》第06章《键值存储》(来源项目 book-sources;源文件:extracted/System Design Interview – An insiders guide, Second Edition/_epub-src/text/part0014_split_003.html) - 结论依据:原文在该位置给出所述对象、机制或比较,支持本卡的解释;原书未展开的实现不作为已证明结论,算式与一致性边界在正文明确限定。 - 原始内容:Distributed key-value store A distributed key-value store is also called a distributed hash table, which distributes key-value pairs across many servers. When designing a distributed system, it is important to understand CAP (Consistency, Availability, Partition Tolerance) theorem. CAP theorem CAP theorem states it is impossible for a distributed system to simultaneously provide more than two of these three guarantees: consistency, availability, and partition tolerance. Let