Semantic Conflict Model for Collaborative Data Structures

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Semenov, Georgii, Aksenov, Vitaly
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913119512559616
author Semenov, Georgii
Aksenov, Vitaly
author_facet Semenov, Georgii
Aksenov, Vitaly
contents Digital collaboration systems support asynchronous work over replicated data, where conflicts arise when concurrent operations cannot be unambiguously integrated into a shared history. While Conflict-Free Replicated Data Types (CRDTs) ensure convergence through built-in conflict resolution, this resolution is typically implicit and opaque to users, whereas existing reconciliation techniques often rely on centralized coordination. This paper introduces a conflict model for collaborative data structures that enables explicit, local-first conflict resolution without central coordination. The model identifies conflicts using semantic dependencies between operations and resolves them by rebasing conflicting operations onto a reconciling operation via a three-way merge over a replicated journal. We demonstrate our approach on collaborative registers, including an explicit formulation of the Last-Writer-Wins Register and a multi-register entity supporting semi-automatic reconciliation.
format Preprint
id arxiv_https___arxiv_org_abs_2602_19231
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Semantic Conflict Model for Collaborative Data Structures
Semenov, Georgii
Aksenov, Vitaly
Distributed, Parallel, and Cluster Computing
Digital collaboration systems support asynchronous work over replicated data, where conflicts arise when concurrent operations cannot be unambiguously integrated into a shared history. While Conflict-Free Replicated Data Types (CRDTs) ensure convergence through built-in conflict resolution, this resolution is typically implicit and opaque to users, whereas existing reconciliation techniques often rely on centralized coordination. This paper introduces a conflict model for collaborative data structures that enables explicit, local-first conflict resolution without central coordination. The model identifies conflicts using semantic dependencies between operations and resolves them by rebasing conflicting operations onto a reconciling operation via a three-way merge over a replicated journal. We demonstrate our approach on collaborative registers, including an explicit formulation of the Last-Writer-Wins Register and a multi-register entity supporting semi-automatic reconciliation.
title Semantic Conflict Model for Collaborative Data Structures
topic Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2602.19231