Ensuring referential integrity under causal consistency

03/09/2018
by   Marc Shapiro, et al.
0

Referential integrity (RI) is an important correctness property of a shared, distributed object storage system. It is sometimes thought that enforcing RI requires a strong form of consistency. In this paper, we argue that causal consistency suffices to maintain RI. We support this argument with pseudocode for a reference CRDT data type that maintains RI under causal consistency. QuickCheck has not found any errors in the model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2022

Impact of the Consistency Model on Checkpointing of Distributed Shared Memory

In this report, we consider the impact of the consistency model on check...
research
06/01/2021

UniStore: A fault-tolerant marriage of causal and strong consistency (extended version)

Modern online services rely on data stores that replicate their data acr...
research
02/02/2018

Extending Causal Consistency to any Object Defined by a Sequential Specification

This paper presents a simple generalization of causal consistency suited...
research
01/08/2019

Inversion-based Measurement of Data Consistency for Read/Write Registers

Both provides and consumers of distributed storage services can benefit ...
research
01/19/2018

Just-Right Consistency: reconciling availability and safety

By the CAP Theorem, a distributed data storage system can ensure either ...
research
08/08/2022

Simple Rigs Hold Fast

An important use of computational systems is updating the state of an ob...
research
05/22/2023

Comments on CausalEC: A Causally Consistent Data Storage Algorithm Based on Cross-Object Erasure Coding

Cadambe and Lyu 2021 presents an erasure coding based algorithm called C...

Please sign up or login with your details

Forgot password? Click here to reset