Update propagation strategies to improve freshness in lazy master replicated databases

Pacitti, Esther; Simon, Eric

doi:10.1007/s007780050010

Cited by 63 publications

(40 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lazy replication usually leads to weak consistency models [46,30] and has to deal with issues not related to Pronto replication model, such as data freshness, i.e., how often the primary should propagate updates to the backups and how often the backups should process these updates [39]. For example, in [58] a real-time primary-backup replication scheme which enforces temporal consistency among replicated servers is considered.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Pronto: High availability for standard off-the-shelf databases

Pedone

Frølund²

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Enterprise applications typically store their state in databases. If a database fails, the application is unavailable while the database recovers. Database recovery is time consuming because it involves replaying the persistent transaction log. To isolate end-users from database failures we introduce Pronto, a protocol to orchestrate the transaction processing by multiple, standard databases so that they collectively implement the illusion of a single, highly-available database. Pronto is a novel replication protocol that handles nondeterminism without relying on perfect failure detection, does not require any modifications in existing applications and databases, and allows databases from different providers to be part of the replicated compound.

show abstract

Section: Related Workmentioning

confidence: 99%

“…case (request = abort(ta)) and (state(ta) = At the primary, committing t a consists of issuing a database commit request and waiting for the response (lines [39][40]. At the backups, committing t a consists of executing all t a 's exec(t a , −) operations (lines 34-38), issuing a database commit operation, and waiting for the response.…”

mentioning

confidence: 99%

Pronto: High availability for standard off-the-shelf databases

Pedone

Frølund²

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

show abstract

“…Performance studies of distributed databases employed analytical methods [20,26,27,16,13,2], as well as simulations [3,17,25,31,18,29,10,7]. Simulations can evaluate complex system models whose level of detail precludes analytical solutions.…”

Section: General Modeling Concepts and Communicationmentioning

confidence: 99%

Increasing the Expressiveness of Analytical Performance Models for Replicated Databases

Nicola

Jarke

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The vast number of design options in replicated databases requires efficient analytical performance evaluations so that the considerable overhead of simulations or measurements can be focused on a few promising options. A review of existing analytical models in terms of their modeling assumptions, replication schemata considered, and network properties captured, shows that data replication and intersite communication as well as workload patterns should be modeled more accurately. Based on this analysis, we define a new modeling approach named 2RC (2-dimensional replication model with integrated communication). We derive a complete analytical queueing model for 2RC and demonstrate that it is of higher expressiveness than existing models. 2RC also yields a novel bottleneck analysis and permits to evaluate the trade-off between throughput and availability.

show abstract

“…In other words, controlling the freshness of nodes for executing read-only queries can help in improving performances through a better load balancing. Many solutions have been proposed in distributed systems for managing replicas [13], [11], [9], [8], [5] and [12]. Some of them include freshness control [15], [7], [10] and [1].…”

Section: Introductionmentioning

confidence: 99%

DTR: Distributed Transaction Routing in a Large Scale Network

Sarr

Naacke

Gançarski

2008

High Performance Computing for Computational Science - VECPAR 2008

View full text Add to dashboard Cite

Abstract. Grid systems provide access to huge storage and computing resources at large scale. While they have been mainly dedicated to scientific computing for years, grids are now considered as a viable solution for hosting data-intensive applications. To this end, databases are replicated over the grid in order to achieve high availability and fast transaction processing thanks to parallelism. However, achieving both fast and consistent data access on such architectures is challenging at many points. In particular, centralized control is prohibited because of its vulnerability and lack of efficiency at large scale. In this article, we propose a novel solution for the distributed control of transaction routing in a large scale network. We leverage a cluster-oriented routing solution with a fully distributed approach that uses a large scale distributed directory to handle routing metadata. Moreover, we demonstrate the feasibility of our implementation through experimentation: results expose linear scale-up, and transaction routing time is fast enough to make our solution eligible for update intensive applications such as world wide online booking.

show abstract

Update propagation strategies to improve freshness in lazy master replicated databases

Cited by 63 publications

References 15 publications

Pronto: High availability for standard off-the-shelf databases

Pronto: High availability for standard off-the-shelf databases

Increasing the Expressiveness of Analytical Performance Models for Replicated Databases

DTR: Distributed Transaction Routing in a Large Scale Network

Contact Info

Product

Resources

About