About Brewer theorem or CAP theorem

Disclaimer, i am using this text from wikipedia in order to get things clear in my head 🙂

Please, read and understand the cap theorem:

from the bless wikipedia:

In theoretical computer science, the CAP theorem, also known as Brewer’s theorem, states that it is impossible for a distributed computer system to simultaneously provide all three of the following guarantees:[1][2][3]

  • Consistency (all nodes see the same data at the same time)
  • Availability (a guarantee that every request receives a response about whether it succeeded or failed)
  • Partition tolerance (the system continues to operate despite arbitrary partitioning due to network failures)

In 2012 Brewer clarified some of his positions, including why the oft-used “two out of three” concept can be misleading or misapplied, and the different definition of consistency used in CAP relative to the one used in ACID.[4]

AP: CassandraCouchDB, DynamoDB,InfiniteGraph

CP: HBasePaxos, MongoDB,Redis

CA: RDBMS like mysql, oracle,SQL server, Neo4J

useful links:

https://en.wikipedia.org/wiki/CAP_theorem

https://es.wikipedia.org/wiki/Teorema_CAP

http://www.genbetadev.com/bases-de-datos/nosql-clasificacion-de-las-bases-de-datos-segun-el-teorema-cap

Advertisements

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 )

w

Connecting to %s