https://arangodb.com/2017/01/reaching-harnessing-consensus-arangodb/ The database for graph and beyond Wed, 17 Apr 2024 07:04:14 +0000 hourly 1 https://wordpress.org/?v=6.7.1 https://arangodb.com/2017/01/reaching-harnessing-consensus-arangodb/#comment-168 Wed, 10 Jan 2018 21:01:00 +0000 http://www.arangodb.com/?p=19571#comment-168 Sorry for the late reply. In the CAP theorem, consistency is related to something else than you might know from ACID transactions. The CAP theorem is only for distributed data stores and when databases say that they are CP or AP they relate to a choice the database will do in case of e.g. network partitioning. In a case of network partitioning (P of CAP) the database is left with two choices. Either guarantee availability and return the most recent information it has stored (choice Availability) or throw an error with a message that because of network partitioning no guarantee can be provided to return the real state of a record. If the database works normal, then all three from the CAP theorem can be provided. Just in a case of some kind of error, the database has to make a choice. Read more about CAP here: https://en.wikipedia.org/wiki/CAP_theorem

]]>