3 ms·

GET /v2/keys/mykey?quorum=true

• 0xdeadbeefbabe 11y ago
  Okay sounds good if that is the solution, but if you have 5 nodes and end up with partitions A and B where A has 2 nodes and B has 3 nodes. Couldn't B have enough for a quorum, but still possibly have stale data?
  • philips 11y ago
    That isn't possible and would break the consistency guarantee of using something like raft. A quorum read or a write are serialized through the raft state machine and thus has to be acknowledged by every member of the cluster.
    • 0xdeadbeefbabe 11y ago
      Getting stale data does not break consistency. The link to the network partition I'm talking about is buried in this presentation http://thesecretlivesofdata.com/raft/ http://thesecretlivesofdata.com/raft/
  • acconsta 11y ago
    Since A doesn't have quorum, writes on the A side of the partition are impossible, and the data in B cannot go stale (but operations can continue through the new master in B). That's the essence of the CAP theorem's consistency-availability trade off. This assumes all reads and writes go through Raft.