CAP Theorm and Distributed Databases

While traditional Database systems thrive for strong ACID properties, on the other end of spectrum are
BASE(Basically Available Soft-state Eventual consistency)distributed database systems like Hbase, Cassandra,
BigTable, Dynamo etc.

If you talk about these distributed systems you will definitely touch the Brewer’s CAP theorem – Beautiful and simple Idea for designing and deploying applications in a distributed environment.
CAP stands for Consistency, Availability, and Partition tolerance.
The theorem simply states that any shared-data system can only achieve TWO OF THESE THREE.
NoSql Distributed databases identify themselves with 2 of the CAP requirements. Eg.

1) BigTable is CA
2) Dynamo is  AP
3) Cassandra is AP
4) Hbase is CP

Check out the links below for CAP theorem explanation.
Introduction of CAP –>
http://www.julianbrowne.com/article/viewer/brewers-cap-theorem

Excellent discussion on  “P” of CAP
http://codahale.com/you-cant-sacrifice-partition-tolerance/

Technical Proof of CAP theorem form Gilbert and Nayncy.
http://lpd.epfl.ch/sgilbert/pubs/BrewersConjecture-SigAct.pdf

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s