Publication

Consistent Main-Memory Database Federations under Deferred Disk Writes

Related publications (64)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Input Acceptance of Transactional Memory

Vincent Gramoli, Pascal Felber

We present the Input Acceptance of Transactional Memory (TM). Despite the large interest for performance of TMs, no existing research work has investigated the impact of solving a conflict that does not need to be solved. Traditional solutions for a TM to ...

World Scientific Publishing2010

MOBIO Database for the ICPR 2010 Face and Speech Competition

Sébastien Marcel

This document presents an overview of the mobile biometry (MOBIO) database. This document is written expressly for the face and speech organised for the 2010 International Conference on Pattern Recognition. ...

Idiap2009

Improving OLTP Concurrency through Early Lock Release

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

Since the beginning of the multi-core era, database systems research has restarted focusing on increasing concurrency. Even though database systems have been able to accommodate concurrent requests, the exploding number of available cores per chip has surf ...

2009

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

Elastic Transactions

Rachid Guerraoui, Vincent Gramoli, Pascal Felber

This paper presents elastic transactions, a variant of the transactional model. Upon conflict detection, an elastic transaction might drop what it did so far within a separate transaction that immediately commits, and initiate a new transaction which might ...

Springer2009

How Live Can a Transactional Memory Be?

Rachid Guerraoui, Michal Kapalka

This paper asks how much liveness a transactional memory (TM) implementation can guarantee. We first devise a formal framework for reasoning about liveness properties of TMs. Then, we prove that the strongest liveness property that a TM can ensure in an as ...

2009

Deferred-update database replication

Rodrigo Malta Schmidt

This thesis is about the design of high-performance fault-tolerant computer systems. More specifically, it focuses on how to develop database systems that behave correctly and with good performance even in the event of failures. Both performance and depend ...

EPFL2008

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

Toward a Theory of Input Acceptance for Transactional Memories

Vincent Gramoli, Pascal Felber

As opposed to database transactional systems, transactional memory (TM) systems are constrained by real-time while treating their input workload. Nevertheless, there is no clear formalization of how a TM should react regarding to a specific input. While TM ...

2008

Tashkent+: Memory-Aware Load Balancing and Update Filtering in Replicated Databases

Willy Zwaenepoel, Sameh Mohamed Elnikety

BEST PAPER AWARDWe present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets of transactions to ...

2007