Damien Katz has posted on GitHub a design document for the data structures, called rev trees, used to support conflict management in Couchbase. The doc also includes references to the way conflict resolution is done in CouchDB and also compares rev trees with the vector clocks.
When this happens [nb the edits are in conflict] Couchbase will store both
edits, pick an interim winner (the same winner will be selected on all
nodes) and “hide” the losing conflict(s) and mark the document as being in
conflict so that it can found, using views and other searches, by an
external agents who can potentially resolve the conflicts.
Original title and link: Conflict Resolution Using Rev Trees and a Comparison With Vector Clocks ( ©myNoSQL)