I’m looking at CouchDB. Documents have versions, and you can have conflicting versions. Does it store the version sequence as a directed acyclic graph (DAG), like dvcs do? If not, how is it implemented?
I’m looking at CouchDB. Documents have versions, and you can have conflicting versions. Does
Share
You cannot rely on versions of documents in CouchDB, they are only kept to allow conflict resolution during replication. Previous versions of documents are deleted during compaction.
The CouchDB wiki has more details on this.