Group-Based Replication of On-Line Transaction Processing Servers

Correia, A.; Sousa, António; Soares, L.; Pereira, José; Moura, Francisco; Oliveira, Rui

doi:10.1007/11572329_19

Cited by 8 publications

(14 citation statements)

References 14 publications

(31 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing proposals adopt the read-one/write-all-available approach for availability and scalability purposes [13,14,11,19,12,7,20]. It offers minimal overhead for read operations and outperforms any other quorum settings in most of the cases [10].…”

Section: Problem Statementmentioning

confidence: 99%

“…We focus on protocols that exploit optimistic execution and in particular the Database State Machine (DBSM) [14,7,20]. These protocols are multi-master, transactions can be submitted to and executed by several replicas, and follow the passive replication paradigm [5,9] in which each transaction is executed by one of the replicas and its state changes propagated to the other replicas.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Revisiting 1-copy equivalence in clustered databases

Oliveira

Pereira

Correia

et al. 2006

Proceedings of the 2006 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

Recently renewed interest in scalable database systems for shared nothing clusters has been supported by replication protocols based on group communication that are aimed at seamlessly extending the native consistency criteria of centralized database management systems. By using a read-one/write-all-available approach and avoiding the fine-grained synchronization associated with traditional distributed locking, one needs just a single distributed interaction step for each update transaction. Therefore the system can easily be scaled to a large number of replicas, especially, with read intensive loads typical of Web server support environments.In this paper we point out that 1-copy equivalence for causal consistency, which is subsumed by both serializability and snapshot isolation criteria, depends on basic session guarantees that are costly to ensure in clusters, especially in a multi-tier environment. We then point out a simple solution that guarantees causal consistency in the Database State Machine protocol and evaluate its performance, thus highlighting the cost of seamlessly providing common consistency criteria of centralized databases in a clustered environment. BACKGROUNDA number of group communication based database replication protocols have been proposed, in particular, considering a readone/write-all-available approach and a single interaction for each update transaction [13,14,19,12]. We focus on protocols that exploit optimistic execution and in particular the Database State Machine (DBSM) [14,7,20]. These protocols are multi-master, transactions can be submitted to and executed by several replicas, and follow the passive replication paradigm [5,9] in which each transaction is executed by one of the replicas and its state changes propagated to the other replicas.A transaction is immediately executed by the replica to which it is submitted without any a priori coordination. Locally, transactions are synchronized according to the specific concurrency control mechanism of the database engine and thus according to the centralized consistency criteria implemented.Read-only transactions are simply executed locally at the database Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. to which they are submitted and thus controlled strictly by the local concurrency control mechanism. In contrast, update transactions are not readily committed upon receiving the commit request. Instead, the tuples read (read-set) and written (write-set) are gathered and a termination protocol initiated. The goal of the termination protocol is to decide the order and the outcome of the transaction such that the global correctness criteria is satisfied. This is achieve...

show abstract

Section: Problem Statementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Revisiting 1-copy equivalence in clustered databases

Oliveira

Pereira

Correia

et al. 2006

Proceedings of the 2006 ACM Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

“…Middleware-based database replication protocols have recently received a lot of attention [1][2][3][4][5][6][7]. The main reason for this stems from the fact that middleware protocols require few or no changes in the database engine.…”

Section: Introductionmentioning

confidence: 99%

Correctness Criteria for Database Replication: Theoretical and Practical Aspects

Zuikevičiūtė

Pedone

2008

On the Move to Meaningful Internet Systems: OTM 2008

View full text Add to dashboard Cite

Abstract. In this paper we investigate correctness criteria for replicated databases from the client's perspective and present their uniform characterization. We further study the effects of different consistency degrees in the context of three middleware-based replication protocols: primarybackup, optimistic update-everywhere and BaseCON, a simple yet faulttolerant middleware-based replication protocol that takes advantage of workload characterization techniques to increase the parallelism in the system. We present three variants of BaseCON, one for each correctness criterion discussed, and analyze its behavior in case of failures and false suspicions. We have implemented the correctness properties in all three protocols considered and show experimentally that stronger consistency does not necessarily imply worse performance. On the contrary, two of the three replication protocols evaluated show no significant performance divergence under the chosen benchmark while ensuring different consistency criterion.

show abstract

“…Unfortunately, scaling existing cluster based replication protocols to a wide area network is troublesome. Notably, the latency of uniform atomic (or safe) delivery required to ensure fault tolerance has a profound impact in optimistic concurrency protocols leading to increased abort rate [11]. This wastes resources and endangers the ability to commit long lived transactions in a busy server.…”

Section: Introductionmentioning

confidence: 99%

“…• Introduces the protocol providing 1-copy equivalence of the native database consistency criterion, even in the presence of faults, while confining group communication within LANs and improving practicality. • Takes advantage of directly implementing stabilization across wide-area directly on TCP/IP to greatly reduce the likelihood of a transaction being aborted during the certification phase, which is the single greatest obstacle to the scalability of previous proposals [11]. • Provides an experimental evaluation of the protocol applied to a multi-version database when running the workload of the industry standard TPC-C bench-mark [29], thus verifying the previous claim.…”

Section: Introductionmentioning

confidence: 99%

A Pragmatic Protocol for Database Replication in Interconnected Clusters

Grov

Soares

Correia

et al. 2006

2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)

Self Cite

View full text Add to dashboard Cite

Multi-master update everywhere database replication, as achieved by protocols based on group communication such as DBSM and Postgres-R, addresses both performance and availability. By scaling it to wide area networks, one could save costly bandwidth and avoid large round-trips to a distant master server. Also, by ensuring that updates are safely stored at a remote site within transaction boundaries, disaster recovery is guaranteed. Unfortunately, scaling existing cluster based replication protocols is troublesome.In this paper we present a database replication protocol based on group communication that targets interconnected clusters. In contrast with previous proposals, it uses a separate multicast group for each cluster and thus does not impose any additional requirements on group communication, easing implementation and deployment in a real setting. Nonetheless, the protocol ensures one-copy equivalence while allowing all sites to execute update transactions. Experimental evaluation using the workload of the industry standard TPC-C benchmark confirms the advantages of the approach.

show abstract

Group-Based Replication of On-Line Transaction Processing Servers

Cited by 8 publications

References 14 publications

Revisiting 1-copy equivalence in clustered databases

Revisiting 1-copy equivalence in clustered databases

Correctness Criteria for Database Replication: Theoretical and Practical Aspects

A Pragmatic Protocol for Database Replication in Interconnected Clusters

Contact Info

Product

Resources

About