Abstract
Modern distributed applications increasingly replicate data to guarantee high availability and optimal user experience. Conflict-free Replicated Data Types (CRDTs) are a family of data types specially designed for highly available systems that guarantee some form of eventual consistency. Designing CRDTs is very difficult because it requires devising designs that guarantee convergence in the presence of conflicting operations. Even though design patterns and structured frameworks have emerged to aid developers with this problem, they mostly focus on statically structured data; nesting and dynamically changing the structure of a CRDT remains to be an open issue.
This paper explores support for nested CRDTs in a structured and systematic way. To this end, we define an approach for building nested CRDTs based on the work of pure operation-based CRDTs, resulting in nested pure operation-based CRDTs. We add constructs to control the nesting of CRDTs into a pure operation-based CRDT framework and show how several well-known CRDT designs can be defined in our framework. We provide an implementation of nested pure operation-based CRDTs as an extension to the Flec, an existing TypeScript-based framework for pure operation-based CRDTs. We validate our approach, 1) by implementing a portfolio of nested data structures, 2) by implementing and verifying our approach in the VeriFx language, and 3) by implementing a real-world application scenario and comparing its network usage against an implementation in the closest related work, Automerge. We show that the framework is general enough to nest well-known CRDT designs like maps and lists, and its performance in terms of network traffic is comparable to the state of the art.
This paper explores support for nested CRDTs in a structured and systematic way. To this end, we define an approach for building nested CRDTs based on the work of pure operation-based CRDTs, resulting in nested pure operation-based CRDTs. We add constructs to control the nesting of CRDTs into a pure operation-based CRDT framework and show how several well-known CRDT designs can be defined in our framework. We provide an implementation of nested pure operation-based CRDTs as an extension to the Flec, an existing TypeScript-based framework for pure operation-based CRDTs. We validate our approach, 1) by implementing a portfolio of nested data structures, 2) by implementing and verifying our approach in the VeriFx language, and 3) by implementing a real-world application scenario and comparing its network usage against an implementation in the closest related work, Automerge. We show that the framework is general enough to nest well-known CRDT designs like maps and lists, and its performance in terms of network traffic is comparable to the state of the art.
Original language | English |
---|---|
Title of host publication | Nested Pure Operation-Based CRDTs |
Editors | Karim Ali, Guido Salvaneschi |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Chapter | 2 |
Pages | 1-26 |
Number of pages | 26 |
Volume | European Conference on Object-Oriented Programming (ECOOP 2023) |
Edition | 37th |
ISBN (Electronic) | 978-3-95977-281-5 |
DOIs | |
Publication status | Published - Jul 2023 |
Event | European Conference on Object-Oriented Programming - University of Washington, Seattle campus, Seattle, United States Duration: 17 Jul 2023 → 21 Jul 2023 Conference number: 2023 |
Publication series
Name | Leibniz International Proceedings in Informatics |
---|---|
Publisher | Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
Volume | 263 |
ISSN (Electronic) | 1868-8969 |
Conference
Conference | European Conference on Object-Oriented Programming |
---|---|
Abbreviated title | ECOOP |
Country/Territory | United States |
City | Seattle |
Period | 17/07/23 → 21/07/23 |
Bibliographical note
Publisher Copyright:© Jim Bauwens and Elisa Gonzalez Boix;