• Corpus ID: 244773163

Operation-based Collaborative Data Sharing for Distributed Systems

@article{Takeichi2021OperationbasedCD,
  title={Operation-based Collaborative Data Sharing for Distributed Systems},
  author={Masato Takeichi},
  journal={ArXiv},
  year={2021},
  volume={abs/2112.00288}
}
  • M. Takeichi
  • Published 1 December 2021
  • Computer Science
  • ArXiv
Collaborative Data Sharing raises a fundamental issue in distributed systems. Several strategies have been proposed for making shared data consistent between peers in such a way that the shared part of their local data become equal. Most of the proposals rely on state-based semantics. But this suffers from a lack of descriptiveness in conflict-free features of synchronization required for flexible network connections. Recent applications tend to use non-permanent connection with mobile devices… 

Figures from this paper

References

SHOWING 1-10 OF 12 REFERENCES

Conflict-free Collaborative Set Sharing for Distributed Systems

A novel scheme for Conflict-free Collaborative Set Sharing that allows both insertion and deletion operations is proposed that will provide a new synchronization method for data sharing and gives a fresh insight into designing conflict-free replicated data types.

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.

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.

BCDS Agent: An architecture for bidirectional collaborative data sharing

  • In Computer Software, Japan Society for Software Science and Technology, Vol.38,
  • 2021

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.

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.

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.

Boomerang: resourceful lenses for string data

The essential property of resourcefulness is formalized-the correct use of keys to associate chunks in the input and output-by defining a refined semantic space of quasi-oblivious lenses, which several previously studied properties of lenses turn out to have compact characterizations in this space.

Dagstuhl seminar on bidirectional transformations (BX)

The Dagstuhl BX seminar, held January 16–21, 2011, brought together researchers from 13 countries across disciplines that study bidirectional transformations to identify commonalities between the disciplines and start to set a cross-disciplinary research agenda.

A programmable editor for developing structured documents based on bidirectional transformations

The editor uses the view-updating technique developed in the database community and a new bidirectional transformation language that can describe not only the relationship between the document source and its view, but also the data dependency in the view.