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 yet another concurrency control analysis platform, CCBench. CCBench
supports seven protocols (Silo, TicToc, MOCC, Cicada, SI, SI with latch-free SSN, 2PL) and …

Research on transaction processing has made significant progress towards improving
performance of main memory multicore OLTP systems under low contention. However …

Many transactions in web applications are constructed ad hoc in the application code. For
example, developers might explicitly use locking primitives or validation procedures to …

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

Distributed transactions on high-overhead TCP/IP-based networks were conventionally
considered to be prohibitively expensive and thus were avoided at all costs. To that end, the …

Pure in-memory database systems offer outstanding performance but degrade heavily if the
working set does not fit into DRAM, which is problematic in view of declining main memory …

We introduce historical what-if queries, a novel type of what-if analysis that determines the
effect of a hypothetical change to the transactional history of a database. For example," how …

Distributed transaction processing over the TCP/IP network suffers from the weak transaction
scalability problem, ie, its performance drops significantly when the number of involved data …

Serializable systems often perform poorly under high contention. In this work, we analyze
this performance limitation through a novel take on conflict windows. Through the lens of …