Pushing the CAP: Strategies for Consistency and Availability.

The CAP theorem asserts that any networked shared-data system can have only two of three desirable properties. However, by explicitly handling partitions, designers can optimize consistency and availability, thereby achieving some trade-off of all three. The featured Web extra is a podcast from Soft...

Full description

Bibliographic Details
Published in:Computer (00189162) Vol. 45; no. 2; p. 23
Main Author: Brewer, Eric
Format: Article
Published: IEEE Feb2012
Subjects:
Online Access:View this record in EBSCOhost
Description
Summary:The CAP theorem asserts that any networked shared-data system can have only two of three desirable properties. However, by explicitly handling partitions, designers can optimize consistency and availability, thereby achieving some trade-off of all three. The featured Web extra is a podcast from Software Engineering Radio, in which the host interviews Dwight Merriman about the emerging NoSQL movement, the three types of nonrelational data stores, Brewer's CAP theorem, and much more.