Concept
Database transaction
Related publications (126)
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 ...
ACM2023Determining an optimum quantity of interleaved instruction streams of defined coroutines
Anastasia Ailamaki, Georgios Psaropoulos
A method for optimizing memory access for database operations is provided. The method may include performing a first database operation by at least executing a first instruction stream associated with the first database operation. The first database opera ...
2023Robustness Against Read Committed: A Free Transactional Lunch
Transaction processing is a central part of most database applications. While serializability remains the gold standard for desirable transactional semantics, many database systems offer improved transaction throughput at the expense of introducing potenti ...
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 MACHINERY2022Efficient 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 ...
EPFL2020Task scheduling for highly concurrent analytical and transaction workloads
Anastasia Ailamaki, Iraklis Psaroudakis
Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and ...
2020Deciding 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 MACHINERY2020Distributed Transactional Systems Cannot Be Fast
Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang, Panagiota Fatourou
We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...
2019