Notes to self: http://en.wikipedia.org/wiki/CAP_theorem http://en.wikipedia.org/wiki/CAP_theorem In theoretical computer science, the CAP theorem, also

Notes to self: http://en.wikipedia.org/wiki/CAP_theorem http://en.wikipedia.org/wiki/CAP_theorem 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] * Consistency (all nodes see the same data at the same time) * Availability (a guarantee that every request receives a response about whether it was successful or failed) * Partition tolerance (the system continues to operate despite arbitrary message loss or failure of part of the system) http://es.wikipedia.org/wiki/Teorema_CAP http://es.wikipedia.org/wiki/Teorema_CAP http://en.wikipedia.org/wiki/ACID http://en.wikipedia.org/wiki/ACID ACID (Atomicity, Consistency, Isolation, Durability)