Conflict-Free Replicated Data Types
By Marc Shapiro, Nuno M. Preguiça, Carlos Baquero, Marek Zawirski. Safety-critical Systems Symposium, 2011
1,022 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Information Systems
View Paper: https://www.semanticscholar.org/paper/af6e869c1bf89d4bff1d56e2a5c06bc71e8d9f81
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Marko Vukolic
- Christian Cachin
- Konstantinos Christidis
- Alexey Tumanov
- Marcos Kawazoe Aguilera
- Joseph M Hellerstein
- Yair Sovran
- Artem Barger
In Information Systems
- Christian Cachin
- Marko Vukolic
- Konstantinos Christidis
- Alexey Tumanov
- Joseph M Hellerstein
- Russell Power
- Jinyang Li
- Angelo De Caro
Citations in the corpus
- Hyperledger fabric: a distributed operating system for permissioned blockchains (2018, methodology): “In the future, we plan to gradually enhance the liveness semantics of Fabric under contention, in particular to support CRDTs [51] for complementing the current version dependency checks, as well as a per-chaincode lead-endorser that would act as a transaction sequencer.”
- Making Geo-Replicated Systems Fast as Possible, Consistent when Necessary (2012, neutral): “Some prior work also aims at increasing operation commutativity: Weihl exploited commutativity-based concurrency control for abstract data types [40]; operational transformation [10, 12] extends non-commutative operations with a transformation that makes them commute; Conflict-free Replicated Data T”
- Serverless Computing: One Step Forward, Two Steps Back (2018, background): “But the result may be both healthy and manageable: this kind of “disorderly” loosely-consistent model has been at the heart of a number of more general-purpose proposals for scalable, available program design in recent years, including from our group [9, 1, 22].”
- Transactional storage for geo-replicated systems (2011, background): “U-sets [43, 53] are a type of set in which commutativity is achieved by preventing a removed element from being added again.”