Algebra of Data Reconciliation

10/12/2021
by   Elod P. Csirmaz, et al.
0

With distributed computing and mobile applications becoming ever more prevalent, synchronizing diverging replicas of the same data is a common problem. Reconciliation – bringing two replicas of the same data structure as close as possible without overriding local changes – is investigated in an algebraic model. Our approach is to consider two sequences of simple commands that describe the changes in the replicas compared to the original structure, and then determine the maximal subsequences of each that can be propagated to the other. The proposed command set is shown to be functionally complete, and an update detection algorithm is presented which produces a command sequence transforming the original data structure into the replica while traversing both simultaneously. Syntactical characterization is provided in terms of a rewriting system for semantically equivalent command sequences. Algebraic properties of sequence pairs that are applicable to the same data structure are investigated. Based on these results the reconciliation problem is shown to have a unique maximal solution. In addition, syntactical properties of the maximal solution allows for an efficient algorithm that produces it.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2023

Efficient algorithms for enumerating maximal common subsequences of two strings

We propose efficient algorithms for enumerating maximal common subsequen...
research
02/11/2022

On the maximal autocorrelation of Rudin-Shapiro sequences

In this paper, we prove that the maximal aperiodic autocorrelation of th...
research
10/10/2017

Combinatorial and Asymptotical Results on the Neighborhood Grid

In 2009, Joselli et al introduced the Neighborhood Grid data structure f...
research
11/28/2017

The Maximal MAM, a Reasonable Implementation of the Maximal Strategy

This note is about a reasonable abstract machine, called Maximal MAM, im...
research
12/26/2018

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

Guth showed that given a family S of n g-dimensional semi-algebraic sets...
research
10/03/2021

The Typed Graph Model

In recent years, the Graph Model has become increasingly popular, especi...
research
07/01/2023

Abstract Orientable Incidence Structure and Algorithms for Finite Bounded Acyclic Categories. II. Data Structure and Fundamental Operations

A data structure for finite bounded acyclic categories has been built, w...

Please sign up or login with your details

Forgot password? Click here to reset