综合论文：CAP理论（英文）.pdfVIP

5/31/12 InfoQ: CAP Twelve Years Later: How the Rules Have Changed En | 中文 | 日本語 | Br 592,113 Apr unique visitors Article Posted by Eric Brewer on May 30, 2012 Share | This article first appeared in Computer magazine and is brought to you by InfoQ IEEE Computer Society . Want to know how software releases can be stress-free and happen with one click? Try Go free! Improving Software Delivery Cycles: Pre-requisites and Inhibitors Requirements, quality and test management e-Kit Agile Practices to Improve Proj ect Management Organization (PMO) Effectiveness Architectures Youve Always Wondered About @QCon New York Go: Agile Release Management Solutions. Go enables predictable, defect- free and timely software releases. The CAP theorem asserts that any net​worked shared-data system can have only two of three desirable properties. How​ever, by explicitly handling partitions, designers can optimize consistency and availability, thereby achieving some trade- off of all three. In the decade since its introduction, designers and researchers have used (and sometimes abused) the CAP theorem as a reason to explore a wide variety of novel distributed systems. The NoSQL movement also has applied it as an argument against traditional databases. The CAP theorem states that any networked shared-data system can have at most two of three desirable properties: consistency (C) equivalent to having a single up-to-date copy of the data; high availability (A) of that data (for updates); and tolerance to network partitions (P). This expression of CAP served its purpose, which was to open the minds of designers to a wider range of systems and tradeoffs; indeed, in the pa