Publication
Transactions in the Jungle
Related publications (86)
One-shot Garbage Collection for In-memory OLTP through Temporality-aware Version Storage
Anastasia Ailamaki, Periklis Chrysogelos, Angelos Christos Anadiotis, Syed Mohammad Aunn Raza
Most modern in-memory online transaction processing (OLTP) engines rely on multi-version concurrency control (MVCC) to provide data consistency guarantees in the presence of conflicting data accesses. MVCC improves concurrency by generating a new version o ...
ACM2023When is it safe to run a transactional workload under Read Committed?
The popular isolation level multiversion Read Committed (RC) exchanges some of the strong guarantees of serializability for increased transaction throughput. Nevertheless, transaction workloads can sometimes be executed under RC while still guaranteeing se ...
ASSOC COMPUTING MACHINERY2023Concurrency control for database theorists
The aim of this paper is to serve as a lightweight introduction to concurrency control for database theorists through a uniform presentation of the work on robustness against Multiversion Read Committed and Snapshot Isolation. ...
ASSOC COMPUTING MACHINERY2022Deciding Robustness for Lower SQL Isolation Levels
While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...
ASSOC COMPUTING MACHINERY2022Robustness against Read Committed for Transaction Templates
The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the perfect isolation of ...
ASSOC COMPUTING MACHINERY2021Efficient Protocols for Enforcing Causal Consistency in Geo-Replicated Key-Value Data Stores
Modern large-scale data platforms manage colossal amount of data, generated by the ever-increasing number of concurrent users. Geo-replicated and sharded key-value data stores play a central role when building such platforms. As the strongest consistency m ...
EPFL2020Distributed Computing with Modern Shared Memory
In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...
EPFL2020Efficient Multi-Word Compare and Swap
Rachid Guerraoui, Mihail Igor Zablotchi
Atomic lock-free multi-word compare-and-swap (MCAS) is a powerful tool for designing concurrent algorithms. Yet, its widespread usage has been limited because lock-free implementations of MCAS make heavy use of expensive compare-and-swap (CAS) instructions ...
Schloss Dagstuhl, Leibniz-Zentrum2020Deciding Robustness for Lower SQL Isolation Levels
While serializability always guarantees application correctness, lower isolation levels can be chosen to improve transaction throughput at the risk of introducing certain anomalies. A set of transactions is robust against a given isolation level if every p ...
ASSOC COMPUTING MACHINERY2020PaRiS: Causally Consistent Transactions with Non-blocking Reads and Partial Replication
Willy Zwaenepoel, Diego Didona, Kristina Spirovska
Geo-replicated data platforms are at the backbone of several large-scale online services. Transactional Causal Consistency (TCC) is an attractive consistency level for building such platforms. TCC avoids many anomalies of eventual consistency, eschews the ...
2019