官术网_书友最值得收藏!

The CAP theorem

The CAP theorem states that it is impossible for a distributed computing system to simultaneously provide all three of the following guarantees:

  • Consistent: All clients see (immediately) the latest data even in the case of updates.
  • Available: All clients can find a replica of some data even in the case of a node failure. This means that even if some part of the system goes down, the clients can still access consistent and valid data.
  • Partition tolerance: The system continues to work regardless of arbitrary message loss or failure of part of the system.

The choice of which features to discard determines the nature of the system. For example, one could sacrifice consistency to get a scalable, simple, and high-performance database management system. Often, the main difference between a relational database and a NoSQL database is consistency. A relational database enforces atomicity, consistency, isolation, and durability (ACID) properties. In contrast, many NoSQL databases adopt the basically available, soft-state, eventual consistency (BASE) model.

主站蜘蛛池模板: 客服| 大足县| 西乌珠穆沁旗| 永昌县| 和政县| 宜丰县| 辉南县| 尼玛县| 长丰县| 沧州市| 英德市| 溧阳市| 同德县| 青州市| 楚雄市| 巴林左旗| 和政县| 祁门县| 博乐市| 修武县| 香格里拉县| 兴文县| 宽甸| 汾阳市| 左云县| 平乐县| 海晏县| 龙里县| 平安县| 武宣县| 喜德县| 香港| 玛多县| 车险| 佛学| 吉木萨尔县| 民和| 东源县| 威信县| 麻城市| 四会市|