Replicated abstract data types: Building blocks for collaborative applications

Roh, Hyun-Gul; Jeon, Myeongjae; Kim, Jin-Soo; Lee, Joonwon

doi:10.1016/j.jpdc.2010.12.006

Cited by 110 publications

(110 citation statements)

References 39 publications

Supporting

Mentioning

109

Contrasting

Unclassified

Order By: Relevance

“…Our definition of causal stability is the stronger notion that no more concurrent messages will be delivered ; here we use it inside the datatype both to discard operations acting as tombstones, and to discard causality information while keeping the operation. Causal stability is close to what is used in the mechanics of Replicated Growable Arrays (RGA) [20], although no definition is presented there.…”

Section: Related Workmentioning

confidence: 93%

“…Conflict-free replicated data types The formalization of the commutativity requirements for concurrent operations in replicated datatypes was introduced in [8,20], and that of the state based semi-lattices was presented in [9]. Afterwards, the integration of the two models with many extensions was presented in Conflict-free Replicated Datatypes [6,7].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Making Operation-Based CRDTs Operation-Based

Baquero

Almeida

Shoker

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Conflict-free Replicated Datatypes (CRDT) can simplify the design of eventually consistent systems. They can be classified into statebased or operation-based. Operation-based designs have the potential for allowing very compact solutions in both the sent messages and the object state size. Unfortunately, the current approaches are still far from this objective. In this paper, we introduce a new 'pure' operation-based framework that makes the design and the implementation of these CRDTs more simple and efficient. We show how to leverage the meta-data of the messaging middleware to design very compact CRDTs, while only disseminating operation names and their optional arguments.

show abstract

Section: Related Workmentioning

confidence: 93%

Section: Related Workmentioning

confidence: 99%

Making Operation-Based CRDTs Operation-Based

Baquero

Almeida

Shoker

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…To ensure convergence, a unique and globally ordered identifier is associated to every object [1], [48]. Various algorithms of CRDT have been proposed such as WOOT [49], WOOTO [50], WOOTH [51], RGA [52], Logoot [53], LogootSplit [54] and Treedoc [55]. Though CRDT proposes efficient solutions in term of time complexity, OT remains more used than CRDT in existing collaborative frameworks probably due to the less space complexity it requires.…”

Section: Rce Should Take Into Account Human Factors As Follows [45]mentioning

confidence: 99%

Collaborative Editing over Opportunistic Networks: State of the Art and Challenges

Alsulami¹,

Cherif²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Emerging Opportunistic Networks (ON) are under intensive research and development by many academics. However, research efforts on ON only addressed routing protocols as well as data dissemination. Too little attention was given to the applications that can be deployed over ON. These are assumed to use immutable data (e.g., photos/video files). Nevertheless, Collaborative Editors (CE) which are based on mutable messages are widely used in many fields. Indeed, they allow many users to concurrently edit the same shared document (e.g., Google Docs). Consequently, it becomes necessary to adapt CE to ON which represents a challenging task. As a matter of fact, CE synchronization algorithms should ensure the convergence of the shared content being modified concurrently by users. In this work, we give an overview on ON and CE in an attempt to combine both states of the art. We highlight the challenges that could be faced when trying to deploy CE over ON.

show abstract

“…To address this, several researchers have explored concurrency control techniques for objects or abstract data types [33,39,47,51,54,60]. Recently, Conflict-Free Replicated Data Types (CRDTs) have been proposed as a way to encode a common class of useful semantic properties: data values that change in an associative, commutative, and idempotent fashion, which guarantees that replicas of such values will eventually converge [55].…”

Section: Object-level Consistencymentioning

confidence: 99%

Consistency without borders

Alvaro

Bailis

Conway

et al. 2013

Proceedings of the 4th Annual Symposium on Cloud Computing

View full text Add to dashboard Cite

Distributed consistency is a perennial research topic; in recent years it has become an urgent practical matter as well. The research literature has focused on enforcing various flavors of consistency at the I/O layer, such as linearizability of read/write registers. For practitioners, strong I/O consistency is often impractical at scale, while looser forms of I/O consistency are difficult to map to application-level concerns. Instead, it is common for developers to take matters of distributed consistency into their own hands, leading to application-specific solutions that are tricky to write, test and maintain.In this paper, we agitate for the technical community to shift its attention to approaches that lie between the extremes of I/O-level and application-level consistency. We ground our discussion in early work in the area, including our own experiences building programmer tools and languages that help developers guarantee distributed consistency at the application level. Much remains to be done, and we highlight some of the challenges that we feel deserve more attention.

show abstract

Replicated abstract data types: Building blocks for collaborative applications

Cited by 110 publications

References 39 publications

Making Operation-Based CRDTs Operation-Based

Making Operation-Based CRDTs Operation-Based

Collaborative Editing over Opportunistic Networks: State of the Art and Challenges

Consistency without borders

Contact Info

Product

Resources

About