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

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.

主站蜘蛛池模板: 南和县| 凤庆县| 大庆市| 丰顺县| 商水县| 沈丘县| 九龙城区| 芒康县| 荣昌县| 南丹县| 海晏县| 商城县| 承德市| 万载县| 河东区| 吴桥县| 邵武市| 剑河县| 阜阳市| 榆树市| 竹山县| 元谋县| 新闻| 定州市| 行唐县| 湾仔区| 桐乡市| 尚志市| 昌图县| 临夏市| 家居| 凭祥市| 婺源县| 西城区| 隆昌县| 湖口县| 东山县| 正定县| 喜德县| 廉江市| 香港|