The CAP theorem is a fundamental result that applies to distributed storage systems. In this
article, we first present and prove two CAP-like impossibility theorems. To state these …

Distributed key-value storage systems are widely used in corporations and across the
Internet. Our research seeks to greatly expand the application space for key-value storage …

BACKGROUND There are tradeoffs involved with constructing data storage systems. More
specifically, in the face of partitions it is pos sible to build a system that is either consistent or …

In data center networks, applications such as dis-tributed key-value stores consume a lot of
CPU resources. The performance of the entire system drops significantly under heavy load …

Causal consistency (CC) is an attractive consistency model for geo-replicated data stores
because it hits a sweet spot in the ease-of-programming versus performance trade-off. We …

In distributed key-value stores, performance fluctuations generally occur across servers,
especially when the servers are deployed in a cloud environment. Hence, the replica …

The CAP theorem and the PACELC model have described the existence of direct trade-offs
between consistency and availability as well as consistency and latency in distributed …

Large-scale key-value storage systems sacrifice consistency in the interest of dependability
(ie, partitiontolerance and availability), as well as performance (ie, latency). Such systems …

Peer-to-Peer systems have been introduced as an alternative to the traditional client–server
scheme. Distributed Hash Tables, a type of structured Peer-to-Peer system, have been …

Enterprise KV stores are often not well suited for HPC applications, and thus cumbersome
end-to-end KV design customization is required to meet the needs of modern HPC …