Data Synchronization: A Complete Theoretical Solution for Filesystems
Elod P. Csirmaz, Laszlo Csirmaz

TL;DR
This paper offers a comprehensive theoretical framework for filesystem synchronization, defining conflict resolution declaratively and proving the existence of sequences to achieve consistent replicas, enhancing clarity and decision-making.
Contribution
It introduces a complete, declaration-based theoretical model for filesystem synchronization, contrasting with existing heuristic operation-based methods.
Findings
Provides a formal classification of conflicts and resolutions.
Proves the existence of operation sequences for synchronization.
Enables analysis of different conflict resolution policies.
Abstract
Data reconciliation in general, and filesystem synchronization in particular, lacks rigorous theoretical foundation. This paper presents, for the first time, a complete analysis of synchronization for two replicas of a theoretical filesystem. Synchronization has two main stages: identifying the conflicts, and resolving them. All existing (both theoretical and practical) synchronizers are operation-based: they define, using some rationale or heuristics, how conflicts are to be resolved without considering the effect of the resolution on subsequent conflicts. Instead, our approach is declaration-based: we define what constitutes the resolution of all conflicts, and for each possible scenario we prove the existence of sequences of operations / commands which convert the replicas into a common synchronized state. These sequences consist of operations rolling back some local changes,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Advanced Data Storage Technologies · Advanced Database Systems and Queries
