Question 1015

Quorum With Loose Ends

A cluster runs N = 3, R = 2, W = 2 with sloppy quorum enabled. A partition leaves a writer able to reach home replica A plus two unrelated nodes, so its write is accepted by A and one fallback node. On the other side of the partition, a reader reaches home replicas B and C. What is the outcome?

A

The read returns both values as siblings, since the fallback node joins the read path during a partition

B

The read returns the stale value, because the write quorum included a node outside the home replica set

C

The read returns the new value, because R + W > N holds no matter which nodes acknowledged the write

D

The read fails, because a sloppy write marks the key unavailable on the home replicas until the hint lands