Publications associées à Journal des transactions

Deciding 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 MACHINERY2022

Deciding Robustness for Lower SQL Isolation Levels

Christoph Koch, Bas Ketsman

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 MACHINERY2020

Distributed 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

Fast General Distributed Transactions with Opacity

Aleksandar Dragojevic, Georgios Chatzopoulos, Stanko Novakovic

Transactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and neve ...

ASSOC COMPUTING MACHINERY2019

A Scale-out Blockchain for Value Transfer with Spontaneous Sharding

Kelong Cong

Bitcoin, as well as many of its successors, require the whole transaction record to be reliably acquired by all nodes to prevent double-spending. Recently, many blockchains have been proposed to achieve scale-out throughput by letting nodes only acquire a ...

IEEE2018

Distributed Transactions: Dissecting the Nightmare

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

Many distributed storage systems are transactional and a lot of work has been devoted to optimizing their performance, especially the performance of read-only transactions that are considered the most frequent in practice. Yet, the results obtained so far ...

2018

Log-Free Concurrent Data Structures

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...

USENIX Association2018

Log-Free Concurrent Data Structures

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous approaches are typically transa ...

USENIX ASSOC2018

Scalability of write-ahead logging on multicore and multisocket hardware

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica, Ippokratis Pandis

The shift to multi-core and multi-socket hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization ba ...

2012

Theory of Transactional Memory

Michal Kapalka

Transactional memory (TM) is a promising paradigm for concurrent programming, in which threads of an application communicate, and synchronize their actions, via inmemory transactions. Each transaction can perform any number of operations on shared data, an ...

EPFL2010

Aether: A scalable approach to logging

Anastasia Ailamaki, Frederick Ryan Johnson, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica, Ippokratis Pandis

The shift to multi-core hardware brings new challenges to database systems, as the software parallelism determines performance. Even though database systems traditionally accommodate simultaneous requests, a multitude of synchronization barriers serialize ...

2010

Improving OLTP Scalability Using Speculative Lock Inheritance

Anastasia Ailamaki, Frederick Ryan Johnson, Ippokratis Pandis

Transaction processing workloads provide ample request level concurrency which highly parallel architectures can exploit. However, the resulting heavy utilization of core database services also causes resource contention within the database engine itself a ...

2009

Transparent scalable database replication

Sameh Mohamed Elnikety

This thesis demonstrates that, despite earlier projections to the contrary, database replication on a cluster of low-cost commodity servers can transparently scale database performance. In a replicated system providing the standard transactional properties ...

EPFL2008

Tashkent: Uniting Durability with Transaction Ordering for High-Performance Scalable Database Replication

Sameh Mohamed Elnikety, Fernando Pedone

In stand-alone databases, the functions of ordering the transaction commits and making the effects of transactions durable are performed in one single action, namely the writing of the commit record to disk. For efficiency many of these writes are grouped ...

2006

Consistent Main-Memory Database Federations under Deferred Disk Writes

Rodrigo Malta Schmidt, Fernando Pedone

Current cluster architectures provide the ideal environment to run federations of main-memory database systems (FMMDBs). In FMMDBs, data resides in the main memory of the federation servers, significantly improving performance by avoiding I/O during the ex ...

2005