ComputingComputer ScienceComputer SystemsData ManagementDatabasesDistributed SystemsConsistency ModelsDatabase ManagementDistributed StorageNosql DatabasesQuery ProcessingResource SharingAvailability TradeoffCap TheoremConsistency In Distributed DatabasesConsistency Trade-offsKey-value Stores
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.
13
Giuseppe DeCandia, Deniz Hastorun, Madan Jampani et al. · 2007 · 3.5K citations
Brian F. Cooper, Raghu Ramakrishnan, Utkarsh Srivastava et al. · Proceedings of the VLDB Endowment · 2008 · 960 citations
Managing update conflicts in Bayou, a weakly connected replicated storage system
Doug Terry, Marvin Theimer, Karin Anna Petersen et al. · 1995 · 814 citations · Full text
Towards robust distributed systems (abstract)
2000 · 784 citations · Full text
Cluster-based scalable network services
Armando Fox, Steven D. Gribble, Yatin Chawathe et al. · 1997 · 527 citations · Full text