• Corpus ID: 244773120

Conflict-free Collaborative Set Sharing for Distributed Systems

@article{Takeichi2021ConflictfreeCS,
  title={Conflict-free Collaborative Set Sharing for Distributed Systems},
  author={Masato Takeichi},
  journal={ArXiv},
  year={2021},
  volume={abs/2112.00286}
}
  • M. Takeichi
  • Published 1 December 2021
  • Computer Science
  • ArXiv
Collaborative Data Sharing is widely noticed to be essential for distributed systems. Among several proposed strategies, conflict-free techniques are considered useful for serverless concurrent systems. They aim at making shared data be consistent between peers in such a way that their local data do not become equal at once, but they arrive at the same data eventually when no updates occur in any peer. Although the Conflict-free Replicated Data Type (CRDT) approach could be used in data sharing… 

Figures from this paper

Operation-based Collaborative Data Sharing for Distributed Systems

This work proposes a novel scheme Operation-based Collaborative Data Sharing that enables conflictfree strategies for synchronization based on operational semantics and aims to settle ourselves in conflict-free data sharing.

References

SHOWING 1-10 OF 16 REFERENCES

Conflict-Free Replicated Data Types

This paper formalises two popular approaches (state- and operation-based) and their relevant sufficient conditions and studies a number of useful CRDTs, such as sets with clean semantics, supporting both add and remove operations, and considers in depth the more complex Graph data type.

Conflict-free Replicated Data Types: An Overview

This document presents an overview of Conflict-free Replicated Data Types research and practice, organizing the presentation in the aspects relevant for the application developer, the system developer and the CRDT developer.

Collaborative data sharing via update exchange and provenance

Methods for realizing a new collaborative data sharing system that connects heterogeneous logical peers using a network of schema mappings are developed, and a novel model for tracking data provenance is incorporated, such that curators may filter updates based on trust conditions over this provenance.

Concurrency control in groupware systems

An algorithm for concurrency control in real-time groupware systems is presented and its advantages are its simplicity of use and its responsiveness: users can operate directly on the data without obtaining locks.

ORCHESTRA: Rapid, Collaborative Sharing of Dynamic Data

This paper describes the initial design and prototype of the ORCHESTRA system, which focuses on managing disagreement among multiple data representations and instances and represents an important evolution of the concepts of peer-to-peer data sharing, which considers revision, disagreement, authority, and intermittent participation.

Toward BX-Based Architecture for Controlling and Sharing Distributed Data

The proposed architecture, called the Dejima architecture, is that BX is not used between peers but used inside each peer, which enables each peer to specify what data is shared and control how data is used in terms of BX.

Bidirectionalizing graph transformations

This work proposes a formal definition of a well-behaved bidirectional semantics for UnCAL, i.e., a graph algebra for the known UnQL graph query language, and proves the usefulness of the approach with nontrivial applications.

Data Integration Models and Architectures for Service Alliances

Three models of multiple service alliances using views using views are presented and these architectures are assessed for their capability of resolving the issues presented above.

Operational transformation in real-time group editors: issues, algorithms, and achievements

An integrative review of the evolution of operational tra=formation techniques, with the go~ of identifying the major is-m, dgotiths, achievements, and remaining Mlenges, and a new optimized generic operational transformation control algorithm.

Configuring Bidirectional Programs with Functions

The framework of bidirectional programming brings about a new approach to viewupdating and synchronization problems and an efficient and reliable implementation of biddirectional transformation.