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 …

This paper presents the design and implementation of Obladi, the first system to provide
ACID transactions while also hiding access patterns. Obladi uses as its building block …

In the wake of rapid advancements in artificial intelligence (AI), we stand on the brink of a
transformative leap in data systems. The imminent fusion of AI and DB (AI× DB) promises a …

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

This paper introduces the first state-based formalization of isolation guarantees. Our
approach is premised on a simple observation: applications view storage systems as black …

On 20 March, 1974, Professor Edward Banfield, of the University of Pennsylvania, was
prevented from delivering a lecture at the University of Chicago. Professor Banfield, who is a …

Concurrency control algorithms are key determinants of the performance of in-memory
databases. Existing algorithms are designed to work well for certain workloads. For …

Distributed transaction systems incur extensive cross-node communication to execute and
commit serializable OLTP transactions. As a result, their performance greatly suffers …

Distributed transactions suffer from poor performance due to two major limiting factors. First,
distributed transactions suffer from high latency because each of their accesses to remote …

Maximizing transaction throughput is key to high-performance database systems, which
focus on minimizing data access conflicts to improve performance. However, finding efficient …