Evaluation of Replication Mechanisms on Selected Database Systems

Workshop em Clouds e Aplicações

The microservice architecture encourages the composition of services through choreography. Choreography favors loose coupling and decentralization. The challenge then arises of finding suitable approaches for carrying it out according to the architectural style proposed by the microservices. This paper describes and compares two strategies for choreographing microservices. The first strategy is event based and makes use of a mediator to convey the messages. The second is called choreographic programming and its great advantage is to provide an overview of choreography. A case study with four microservices was implemented in each strategy. Results include a comparative table and the number of messages per minute supported by implementations.

Proceedings of the 2009 EDBT/ICDT Workshops on - EDBT/ICDT '09, 2009

In distributed systems, replication is used for ensuring availability and increasing performances. However, the heavy workload of distributed systems such as web2.0 applications or Global Distribution Systems, limits the benefit of replication if its degree (i.e., the number of replicas) is not controlled. Since every replica must perform all updates eventually, there is a point beyond which adding more replicas does not increase the throughput, because every replica is saturated by applying updates. Moreover, if the replication degree exceeds the optimal threshold, the useless replica would generate an overhead due to extra communication messages. In this paper, we propose a suitable replication management solution in order to reduce useless replicas. To this end, we define two mathematical models which approximate the appropriate number of replicas to achieve a given level of performance. Moreover, we demonstrate the feasibility of our replication management model through simulation. The results expose the effectiveness of our models and their accuracy.

International Journal of Cyber and IT Service Management, 2022

Today's computer applications have ever-increasing database system capabilities and performance. The growing amount of data that has to be processed in a business company makes centralized data processing ineffective. This inefficiency shows itself as a long reaction time. This is in direct opposition to the purpose of utilizing databases in data processing, which is to reduce the amount of time it takes to process data. Another database design is required to tackle this problem. Distributed database technology refers to an architecture in which several servers are linked together, and each one may process and fulfill local queries. Each participating server is responsible for serving one or more requests. In a multi-master replication scenario, all sites are main sites, and all main sites communicate with one another. The distributed database system comprises numerous linked computers that work together as a single system.

Proceedings of the 18th International Database Engineering & Applications Symposium on - IDEAS '14, 2014

One of the most demanding needs in cloud computing is that of having scalable and highly available databases. One of the ways to attend these needs is to leverage the scalable replication techniques developed in the last decade. These techniques allow increasing both the availability and scalability of databases. Many replication protocols have been proposed during the last decade. The main research challenge was how to scale under the eager replication model, the one that provides consistency across replicas. In this paper, we examine three eager database replication systems available today: Middle-R, C-JDBC and MySQL Cluster using TPC-W benchmark. We analyze their architecture, replication protocols and compare the performance both in the absence of failures and when there are failures.

International Journal of Parallel, Emergent and Distributed Systems, 2019

Data Grids allow many organizations and individuals to share their data across long-distance areas. Nowadays, a huge amount of data is produced in all scientific fields and to enhance collaboration and data sharing, it is necessary to make this data available to as many nodes of the grid as possible. Data replication is the technique used to provide this availability. Moreover, it improves access time and reduces the bandwidth used. Recently, data replication has received considerable attention and several new algorithms have been developed. This article provides an overview of the state-of-the-art techniques of data replication. We identify the advantages and disadvantages of these strategies and discuss about their performance.

International Journal of Computer Applications, 2013

In this paper, a database replication algorithm is presented. The main idea is to reduce the latency in database replication while maintaining very high throughput. The main points of the algorithm are detailed in this paper. Simulation results are presented to evaluate throughput and average delay. For the in-depth analysis of the algorithm, various cases are considered and it has been found that if the numbers of servers that can serve requests are larger in number then throughput is very high with very less average delay. The overall, throughput and average delay also depend heavily on the load and if load is comparatively less (< 0.8) then the throughput is very high and average delay is nearly zero.

Bioscience Biotechnology Research Communications

Replication structures are research areas of all distributed databases. We provide an overview in this paper for comparing the replication strategies for such database systems. The problems considered are data consistency and scalability. These problems preserve continuity with all its replicas spread across multiple nodes between the actual real time event in the external world and the images. A framework for a replicated real time database is discussed and all time constraints are preserved. To broaden the concept of modeling a large database, a general outline is presented which aims to improve the consistency of the data.

Proceedings 19th IEEE Symposium on Reliable Distributed Systems SRDS-2000, 2000

Data replication is an increasingly important topic as databases are more and more deployed over clusters of workstations. One of the challenges in database replication is to introduce replication without severely affecting performance. Because of this difficulty, current database products use lazy replication, which is very efficient but can compromise consistency. As an alternative, eager replication guarantees consistency but most existing protocols have a prohibitive cost. In order to clarify the current state of the art and open up new avenues for research, this paper analyses existing eager techniques using three key parameters. In our analysis, we distinguish eight classes of eager replication protocols and, for each category, discuss its requirements, capabilities, and cost. The contribution lies in showing when eager replication is feasible and in spelling out the different aspects a database replication protocol must account for.

2011

The necessity of ever-increasing use of distributed data in computer networks is obvious for all. One technique that is performed on the distributed data for increasing of efficiency and reliablity is data rplication. In this paper, after introducing this technique and its advantages, we will examine some dynamic data replication. We will examine their characteristies for some overus scenario and the we will propose some suggestion for their improvement.