A string-wise CRDT for group editing

Yu, Weihai

doi:10.1145/2389176.2389198

Cited by 10 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since RGA is the most efficient algorithm for downstream execution, and since block-wise algorithm improve efficiency of both upstream and downstream execution [26], we propose a new algorithm called RGATreeSplit that combine these concepts.…”

Section: Rgatreesplit: a Block-wise Rga With Identifier Structurementioning

confidence: 99%

“…A block-wise RGA node contains the information usual to RGA with some additional metadata. This algorithm uses the notions of split and offset introduced by Yu [26]. A block identifier is composed of a CRDT identifier plus an offset.…”

Section: Block-wise Rgamentioning

confidence: 99%

“…Unique identifiers allow a quicker and easier downstream execution, but must be generated and retrieved during upstream execution. A first improvement is to coarsen the granularity to identify large blocks rather than single characters [26]. Indeed, collaborative documents are often written block by block -copy/paste or batch operations for instance.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

High Responsiveness for Group Editing CRDTs

Briot

Urso

Shapiro

2016

Proceedings of the 19th International Conference on Supporting Group Work

View full text Add to dashboard Cite

Group editing is a crucial feature for many end-user applications. It requires high responsiveness, which can be provided only by optimistic replication algorithms, which come in two classes: classical Operational Transformation (OT), or more recent Conflict-Free Replicated Data Types (CRDTs). Typically, CRDTs perform better on downstream operations, i.e., when merging concurrent operations than OT, because the former have logarithmic complexity and the latter quadratic. However, CRDTs are often less responsive, because their upstream complexity is linear. To improve this, this paper proposes to interpose an auxiliary data structure, called the identifier data structure in front of the base CRDT. The identifier structure ensures logarithmic complexity and does not require replication or synchronization. Combined with a block-wise storage approach, this approach improves upstream execution time by several orders of magnitude, with negligeable impact on memory occupation, network bandwidth, and downstream execution performance.

show abstract

Section: Rgatreesplit: a Block-wise Rga With Identifier Structurementioning

confidence: 99%

Section: Block-wise Rgamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

High Responsiveness for Group Editing CRDTs

Briot

Urso

Shapiro

2016

Proceedings of the 19th International Conference on Supporting Group Work

View full text Add to dashboard Cite

show abstract

“…This allows distinguishing two classes of sequence CRDTs: (i) Fixed size identifier (also called the tombstones class). This class includes WOOT [11], WOOTO [20], WOOTH [1], CT [7], RGA [13], [23]. In this class, a tombstone replaces each suppressed element.…”

Section: Introductionmentioning

confidence: 99%

Lseq

Nédelec

Molli

Mostéfaoui

et al. 2013

Proceedings of the 2013 ACM Symposium on Document Engineering

View full text Add to dashboard Cite

Distributed collaborative editing systems allow users to work distributed in time, space and across organizations. Trending distributed collaborative editors such as Google Docs, Etherpad or Git have grown in popularity over the years. A new kind of distributed editors based on a family of distributed data structure replicated on several sites called Conflict-free Replicated Data Type (CRDT for short) appeared recently. This paper considers a CRDT that represents a distributed sequence of basic elements that can be lines, words or characters (sequence CRDT). The possible operations on this sequence are the insertion and the deletion of elements. Compared to the state of the art, this approach is more decentralized and better scales in terms of the number of participants. However, its space complexity is linear with respect to the total number of inserts and the insertion points in the document. This makes the overall performance of such editors dependent on the editing behaviour of users. This paper proposes and models LSEQ, an adaptive allocation strategy for a sequence CRDT. LSEQ achieves in the average a sub-linear spatial-complexity whatever is the editing behaviour. A series of experiments validates LSEQ showing that it outperforms existing approaches.

show abstract

“…Tombstone-based CRDTs [1,9,20,22,32,35,36] such as WOOT [20] associate a constant size identifier O(1) to each element but removals of elements only hide them to users. Therefore, removed elements keep consuming space leading to a monotonically growing replica, hence Θ(I) where I is the number of insertions performed on the document.…”

mentioning

confidence: 99%

A scalable sequence encoding for collaborative editing

Nédelec

Molli

Mostéfaoui

2017

Concurrency and Computation

View full text Add to dashboard Cite

International audienceDistributed real-time editors made real-time editing easy for millions of users. However, main stream editors rely on Cloud services to mediate sessions raising privacy and scalability issues. Decentralized editors tackle privacy issues but scalability issues remains. We aim to build a decentralized editor that allows real-time editing anytime, anywhere, whatever is the number of participants. In this paper, we propose an approach based on a massively replicated sequence data structure that represents the shared document. We establish an original tradeoff on communication, time and space complexity to maintain this sequence over a network of browsers. We prove a sublinear upper bound on communication complexity while preserving an affordable time and space complexity. In order to validate this tradeoff, we built a full working editor and measured its performance on large scale experiments involving up till 600 participants. As expected, the results show a traffic increasing as O((log I)^2 ln R) where I is the number of insertions in the document, and R the number of participants

show abstract

A string-wise CRDT for group editing

Cited by 10 publications

References 13 publications

High Responsiveness for Group Editing CRDTs

High Responsiveness for Group Editing CRDTs

Lseq

A scalable sequence encoding for collaborative editing

Contact Info

Product

Resources

About