The increasing popularity of blockchain-based cryptocurrencies has made scalability a
primary and urgent concern. We analyze how fundamental and circumstantial bottlenecks in …

There is currently an active debate on which RDMA primitive (ie, one-sided or two-sided) is
optimal for distributed transactions. Such a debate has led to a number of optimizations …

Persistent memory (PM) disaggregation improves the resource utilization and failure
isolation to build a scalable and cost-effective remote memory pool. However, due to offering …

Runtime verification is an area of formal methods that studies the dynamic analysis of
execution traces against formal specifications. Typically, the two main activities in runtime …

Recent transaction processing systems attempt to leverage advanced hardware features like
RDMA and HTM to significantly boost performance, which, however, pose several limitations …

In order to guarantee recoverable transaction execution, database systems permit a
transaction's writes to be observable only at the end of its execution. As a consequence …

This paper presents Basil, the first transactional, leaderless Byzantine Fault Tolerant key-
value store. Basil leverages ACID transactions to scalably implement the abstraction of a …

We describe the design, implementation, and evaluation of Occult (Observable Causal
Consistency Using Lossy Timestamps), the first scalable, geo-replicated data store that …

Today's cloud databases offer strong properties, including serializability, sometimes called
the gold standard database correctness property. But cloud databases are complicated …

OLTP systems can often improve throughput by batching transactions and processing them
as a group. Batching has been used for optimizations such as message packing and group …