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.