Substantial research efforts have been devoted to studying the performance optimality
problem for distributed database transactions. However, they focus just on optimizing …

Transactional Causal Consistency (TCC) extends causal consistency, the strongest
consistency model compatible with availability, with interactive read-write transactions, and …

Causal consistency is an attractive consistency model for replicated data stores. It is
provably the strongest model that tolerates partitions, it avoids the long latencies associated …

Geo-replicated data platforms are the backbone of several large-scale online services.
Transactional Causal Consistency (TCC) is an attractive consistency level for building such …

Data placement is critical for the scalability of decentralized object-based storage systems.
The state-of-the-art CRUSH placement method is a decentralized algorithm that …

Causal Consistency has been proven to be the strongest type of consistency that can be
achieved in a fault-tolerant, distributed system. This paper describes an implementation of D …

Modern online services rely on data stores that replicate their data across geographically
distributed data centers. Providing strong consistency in such data stores results in high …

Effective data exchange holds the potential to bridge information gaps between
organizations, creating essential prerequisites for enhanced collaboration. However, in …

The current causal consistency model has trouble facing the high synchronization
overheads and response delays found in cloud storage systems. This paper proposes a …

This paper presents an algorithm, called BCM-Broadcast, for the implementation of causal
broadcast in distributed mobile systems in the presence of Byzantine failures. The BCM …