Publication

Optimistic Algorithms for Partial Database Replication

Related publications (42)

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.

Improving Fast Paxos: being optimistic with no overhead

André Schiper

The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f < n/2, and in one communication step with f < n/3 (f is the maximum number of faulty processes). This l ...

2006

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

Beyond 1-Safety and 2-Safety for replicated databases: Group-Safety

André Schiper, Matthias Wiesmann

In this paper, we study the safety guarantees of group communication-based database replication techniques. We show that there is a model mismatch between group communication and database, and because of this, classical group communication systems cannot b ...

2004

Generalized Snapshot Isolation and a Prefix-Consistent Implementation

Willy Zwaenepoel, Sameh Mohamed Elnikety, Fernando Pedone

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

Beyond 1-Safety and 2-Safety for Replicated Databases: Group-Safety

André Schiper, Matthias Wiesmann

2003

Conflict-Aware Scheduling for Dynamic Content Applications

Willy Zwaenepoel

We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializa ...

2003

Group communications and database replication

Matthias Wiesmann

Databases are an important part of today's IT infrastructure: both companies and state institutions rely on database systems to store most of their important data. As we are more and more dependent on database systems, securing this key facility is now a p ...

EPFL2002

Fast Indulgent Consensus with Zero Degradation

Rachid Guerraoui, Partha Dutta

This paper describes a new consensus algorithm for the asynchronous message passing system model augmented with an unreliable failure detector abstraction: channels are reliable, processes can fail by crashing, and the detection of crashes are not reliable ...

2002

Using Optimistic Atomic Broadcast in Transaction Processing Systems

André Schiper, Matthias Wiesmann, Fernando Pedone

Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, s ...

2001