Data Synchronization: A Complete Theoretical Solution for Filesystems

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00570143" target="_blank" >RIV/67985556:_____/22:00570143 - isvavai.cz</a>

Result on the web

<a href="https://www.mdpi.com/1999-5903/14/11/344" target="_blank" >https://www.mdpi.com/1999-5903/14/11/344</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3390/fi14110344" target="_blank" >10.3390/fi14110344</a>

Result language

angličtina

Original language name

Data Synchronization: A Complete Theoretical Solution for Filesystems

Original language description

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, followed by operations performed on the other replica. The set of rolled-back operations provides the user with clear and intuitive information on the proposed changes, so she can easily decide whether to accept them or ask for other alternatives. All possible synchronized states are described by specifying a set of conflicts, a partial order on the conflicts describing the order in which they need to be resolved, as well as the effect of each decision on subsequent conflicts. Using this classification, the outcomes of different conflict resolution policies can be investigated easily.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GA19-04579S" target="_blank" >GA19-04579S: Conditonal independence structures: methods of polyhedral geometry</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2022

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

FUTURE INTERNET

ISSN

1999-5903

e-ISSN

1999-5903

Volume of the periodical

14

Issue of the periodical within the volume

11

Country of publishing house

CH - SWITZERLAND

Number of pages

21

Pages from-to

344

UT code for WoS article

000895262800001

EID of the result in the Scopus database

2-s2.0-85149162425