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

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.

主站蜘蛛池模板: 恭城| 钟山县| 荆门市| 缙云县| 陆丰市| 东平县| 青河县| 潞城市| 富阳市| 忻城县| 科技| 磐石市| 平武县| 乐山市| 监利县| 长泰县| 仙游县| 北票市| 凌海市| 长海县| 麟游县| 东兴市| 上犹县| 大名县| 莫力| 苏尼特右旗| 中方县| 临汾市| 天镇县| 商河县| 穆棱市| 台中市| 新田县| 高阳县| 临澧县| 宜川县| 平潭县| 宜昌市| 洪雅县| 保定市| 七台河市|