Supporting Linearizable Semantics in Replicated Databases


This paper proposes a novel database replication algorithm that offers strong consistency (linearizable semantics) and allows reads and non-conflicting writes to execute in parallel in multiple replicas. The proposed algorithm supports the use of quorums to trade the availability/efficiency of read and write operations, making a bridge between consensus-based and quorum based solutions for database replication. Furthermore, the algorithm offers better performance for linearizable read-only transactions with a negligible impact on write transactions.

DOI: 10.1109/NCA.2008.22

Extracted Key Phrases

1 Figure or Table

Showing 1-10 of 15 references

On the use of a reflective architecture to augment database management systems

  • N Carvalho, A Correia Jr, J Pereira, L Rodrigues, R Oliveira, S Guedes
  • 2007
1 Excerpt

Reliable Distributed Systems

  • R Guerraoui, L Rodrigues
  • 2006

Fault-Tolerant Broadcasts and Related Problems

  • V Hadzilacos, S Toueg
  • 1993

An efficient and fault-tolerant solution for distributed mutual exclusion

  • D Agrawal, A El-Abbadi
  • 1991