Slide 15
Slide 15 text
What if conflict occur?
• CouchDB will choose an arbitrary winner based on a deterministic
algorithm*
• Both clients will see the same winner once they're back online
1. The revision with the longest revision history list becomes the winning revision.
2. If they are the same, the _rev values are compared in ASCII sort order,
* Usually, we don’t need to care about the algorithm, just for your interest about the implementation