CAP

最新推荐文章于 2025-05-07 20:42:39 发布

原创最新推荐文章于 2025-05-07 20:42:39 发布 · 153 阅读

0 ·

CC 4.0 BY-SA版权

J2EE事务相关专栏收录该内容

16 篇文章

订阅专栏

介绍了CAP理论，即在共享数据系统中，数据一致性、系统可用性和网络分区容忍性三者中只能同时实现两个。探讨了最终一致性作为弱一致性的概念，即使在更新后存在不一致窗口，但在没有更多更新的情况下，最终将返回最后更新的值。

CAP理论

Eric Brewer , systems professor at the University of California, Berkeley, and at that time head of Inktomi, brought the different trade-offs together in a keynote address to the PODC (Principles of Distributed Computing) conference in 2000.¹ He presented the CAP theorem, which states that of three properties of shared-data systems—data consistency, system availability, and tolerance to network partition —only two can be achieved at any given time.

Eventually Consistency

one of the weak consistency. That is, if no more updates on the given object, accessing the object will always return the last updated value. Of couse, there is a time period between the update and all observers seeing the updated value, which called inconsistency Window.