hesela.devQuorum intersection
Quorum intersection is the property that every relevant pair of allowed quorums shares at least one replica.
For arbitrary R-member read sets and W-member write sets drawn from the same fixed N replicas, R + W > N guarantees overlap; this is the equal-vote case of quorum voting. [1] Two W-member write sets must overlap when 2W > N. These are set properties, not standalone consistency protocols.
Relations
- related
- read-quorum, write-quorum, sloppy-quorum, linearizability
Limitations
- Intersection alone does not establish linearizability, repair coverage or persistent storage of acknowledged data. [2, 1]