Concept

Durability (database systems)

Related publications (60)

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.

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. FMMDBs significantly improve performance by avoiding I/O during t ...

2005

Time-complexity bounds on agreement problems

Partha Dutta

In many distributed systems, designing an application that maintains consistency and availability despite failure of processes, involves solving some form of agreement. Not surprisingly, providing efficient agreement algorithms is critical for improving th ...

EPFL2005

Comparison of Database Replication Techniques Based on Total Order Broadcast

André Schiper, Matthias Wiesmann

In this paper, we present a performance comparison of database replication techniques based on total order broadcast. While the performance of total order broadcast-based replication techniques has been studied in previous papers, this paper presents many ...

2005

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Marko Vukolic, Ron Levy

This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchronous robust implementations where a writer and a set of reader processes (cl ...

2005

The CHT Play

Rachid Guerraoui, Felix Gaertner

This note gives a high level and informal account of the necessary part of the proof that Ω is the weakest failure detector to implement consensus with a majority of correct processes. The proof originally appeared in a widely cited but rarely understood p ...

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

Fast Non-Blocking Atomic Commit: An Inherent Trade-off

Rachid Guerraoui, Bastian Pochon, Partha Dutta

This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t > 3 an inherent trade-off between the fast abort property of N ...

2004

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

Pragmatic Type Interoperability

Rachid Guerraoui, Patrick Eugster

Providing type interoperability consists in ensuring that, even if written by different programmers, possibly in different languages and running on different platforms, types that are supposed to represent the same software module are indeed treated as one ...

2003