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.

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

Database Replication Using Generalized Snapshot Isolation

Willy Zwaenepoel, Sameh Mohamed Elnikety, Fernando Pedone

Generalized snapshot isolation extends snapshot isolation as used in Oracle and other databases in a manner suitable for replicated databases. While (conventional) snapshot isolation requires that transactions observe the “latest” snapshot of the database, ...

2005

Generalized Snapshot Isolation and a Prefix-Consistent Implementation

Willy Zwaenepoel, Sameh Mohamed Elnikety, Fernando Pedone

2004

Pronto: High Availability for Standard Off-the-shelf Databases

Fernando Pedone

Enterprise applications typically store their state in databases. If a database fails, the application is unavailable while the database recovers. Database recovery is time consuming because it involves replaying the persistent transaction log. To isolate ...

2004

The weakest failure detectors to solve Quittable Consensus and Non-Blocking Atomic Commit

Rachid Guerraoui

We introduce quittable consensus, a natural variation of the consensus problem, where processes have the option to agree on “quit” if failures occur, and we relate this problem to the well-known problem of non-blocking atomic commit. We then determine the ...

2004

The Database State Machine Approach

Rachid Guerraoui, André Schiper, Fernando Pedone

Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transactional mechanisms, such as atomic commitment. We present the Database State Mac ...

2003

Porting OMTTs to CORBA

Jörg Kienzle

The Common Object Request Broker Architecture standardizes a platform- and programming-language-independent distributed object com-puting environment. It also provides a standard for several distributed servic-es. The Object Transaction Service provides an ...

2003

Porting OMTTs to CORBA

Jörg Kienzle

Springer-Verlag2003

The Weakest Failure Detector for Non-Blocking Atomic Commit

Rachid Guerraoui

This paper addresses the question of the weakest failure detector for solving the Non-Blocking Atomic Commit problem (NBAC) in a message passing system where processes can fail by crashing. We define a failure detector, denoted by X, which we show to be su ...

2003