0% found this document useful (0 votes)
11 views1 page

CAP Theorem in NoSQL Databases

The document classifies distributed NoSQL databases based on the CAP theorem, which states that a distributed system cannot simultaneously provide consistency, availability, and partition tolerance. It shows that some NoSQL databases like Cassandra and Dynamo sacrifice consistency (C) for availability (A) and partition tolerance (P), while others like Bigtable and Hypertable sacrifice availability (A) for consistency (C) and partition tolerance (P). Traditional RDBMS systems provide consistency (C) but cannot guarantee availability (A) and partition tolerance (P) in distributed environments.

Uploaded by

kgrchandran
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views1 page

CAP Theorem in NoSQL Databases

The document classifies distributed NoSQL databases based on the CAP theorem, which states that a distributed system cannot simultaneously provide consistency, availability, and partition tolerance. It shows that some NoSQL databases like Cassandra and Dynamo sacrifice consistency (C) for availability (A) and partition tolerance (P), while others like Bigtable and Hypertable sacrifice availability (A) for consistency (C) and partition tolerance (P). Traditional RDBMS systems provide consistency (C) but cannot guarantee availability (A) and partition tolerance (P) in distributed environments.

Uploaded by

kgrchandran
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

CAP Classification for Distributed NO SQL Systems

Availability:
A The system shall be available and
provide response to any request.

Traditional RDBMS
SQL Server, Oracle,
PostgreSQL, MySQL etc. Cassandra, Dynamo, Riak,
Couch DB, Voldemort etc.
Also: Neo4j, Greenplum,

AP
CA
Vertica, Spanner etc.

CP
Consistency: C
All the nodes in the partition see the
BigTable, Hypertable, P Partition Tolerance:
The system is tolerant to network
HDFS, Hbase, Redis,
same data all the time. i.e., data is partition failures. In distributed
MongoDB, Memcached etc.
consistent across partitions systems, this is not a choice but a
need.

Ratheesh Krishna Geeth

You might also like