Database Replication Research Articles

Implementation of High Availability Based on Load Balancing and Failover Method in E-commerce Using MySQL Database

The rapid growth of e-commerce has brought about challenges in managing traffic loads and ensuring the availability of database servers. One critical issue is what happens when the main database server fails, potentially leading to downtime or data loss. This research aims to address these problems by optimizing server resource distribution and implementing data replication across multiple database servers. The goal is to enhance system efficiency, prevent server overloads, ensure data availability, and minimize downtime or data loss when server failures occur.This research utilizes a multi-stage methodology. First, data collection was conducted to gather relevant information. In the second stage, a needs analysis was performed to identify system requirements. The third stage involved designing the system architecture, including the creation of entity-relationship diagrams (ERD), flowcharts, and network topologies. In the final stage, the system was implemented through database replication and the application of failover methods.The results demonstrate that the failover mechanism operates effectively, ensuring that data is successfully replicated across all database servers. This confirms that the system achieves high availability and minimizes the risk of data loss or service downtime. The implications of this research provide a reliable solution for improving the resilience and performance of e-commerce systems, particularly in managing database server failures.

Exploring potential plasma drug targets for cholelithiasis through multiancestry Mendelian randomization.

Cholelithiasis poses significant health and economic burdens, necessitating novel pharmacological targets to enhance treatment efficacy. Based on genome-wide association analysis (GWAS) studies, we performed two-sample Mendelian randomization (MR) analysis based on plasma proteomics to explore potential drug targets in European (nCase=40,191 and nControl=361,641) and Asian (nCase=9,305 and nControl=168,253) populations. We confirmed the directionality and robust correlation of the drug targets with the results through reverse MR analysis, Steiger filtering, Bayesian colocalization, phenotype scanning and replication in multiple databases. Further exploration of the safety and possible mechanisms of action of phenome-wide MR analysis and protein‒protein interactions (PPIs) as individual drug targets was performed. Our proteomics-based MR analyses suggested that FUT3 (OR=0.87; 95% CI, 0.84-0.89; P=4.70×10-32), NOE1 (OR=0.58; 95% CI, 0.52-0.66; P=4.21×10-23), UGT1A6 (OR=0.68; 95% CI, 0.64-0.73; P=9.58×10-30) and FKBP52 (OR=1.75; 95% CI, 1.37-2.24; P=8.61×10-6) were potential drug targets in Europeans, whereas KLB (OR=1.11; 95% CI, 1.07-1.16; P=7.59×10-7) and FGFR4 (OR=0.94; 95% CI, 0.91-0.96; P=4.07×10-6) were valid targets in East Asians. There was no reverse causality for these drug targets. Evidence from Bayesian colocalization analyses supported that exposure and outcome shared consistent genetic variables. Phenome-wide MR analysis suggested the potential deleterious effects of NOE1 and FGFR4. PPI analysis confirmed the pathways associated with the potential targets involved in bile acid metabolism. Genetically predicted levels of the plasma proteins FUT3, NOE1, UGT1A6 and FKBP52 have potential as prospective targets in Europeans. Moreover, the plasma levels of KLB and FGFR4 may serve as potential targets for the treatment of cholelithiasis in East Asians.

Group Key Management Protocols for Non-Network: A Survey

The phenomenal rise of the Internet in recent years, as well as the expansion of capacity in today's networks, have provided both inspiration and incentive for the development of new services that combine phone, video, and text "over IP." Although unicast communications have been prevalent in the past, there is an increasing demand for multicast communications from both Internet Service Providers (ISPs) and content or media providers and distributors. Indeed, multicasting is increasingly being used as a green verbal exchange mechanism for institution-oriented programmers on the Internet, such as video conferencing, interactive college games, video on demand (VoD), TV over the Internet, e-learning, software programme updates, database replication, and broadcasting inventory charges. However, the lack of security within the multicast verbal exchange model prevents the effective and large-scale adoption of such important company multi-celebration activities. This situation prompted a slew of research projects that addressed a variety of issues related to multicast security, including confidentiality, authentication, watermarking, and access control. These issues should be viewed within the context of the safety regulations that work in the specific conditions. For example, in a public inventory charge broadcast, while identification is a vital necessity, secrecy is not. In contrast, video-convention programme requires both identification and confidentiality. This study gives a complete examination and comparison of the issues of group key management. Both network-dependent and network-independent approaches are used. The study also addresses the advantages, disadvantages, and security problems of various protocols.

Database Replication for Disconnected Operations with Quasi Real-Time Synchronization

Database replication is a way to improve system throughput or achieve high availability. In most cases, using an active-active replica architecture is efficient and easy to deploy. Such a system has CP properties (from the CAP theorem: Consistency, Availability and network Partition tolerance). Creating an AP (available and partition tolerant) system requires using multi-primary replication. This approach, because of many difficulties in implementation, is not widely used. However, deployment of CCDB (experiment conditions and calibration database) needs to be an AP system in two locations. This necessity became an inspiration to examine the state-of-the-art in this field and to test the available solutions. The tests performed evaluate the performance of the chosen replication tools: Bucardo and EDB Replication Server. They show that the tested tools can be successfully used for continuous synchronization of two independent database instances.

An Automated Disaster Recovery Strategies for Fintech Infrastructure

This paper aims to present an extensive and well-defined review of the automatic disaster recovery strategies for fintech infrastructure. Since financial operations are gradually relying more on technology, business continuity, and data protection in case of disasters have become fundamental matters. The automation of disaster recovery systems relies on well-designed technologies and methods to reduce downtime, data loss, and financial damage. Organizations are, therefore, able to maintain business continuity and regulatory standards. The article covers AR, deep learning, and AI robotics that will be used for disaster recovery automation. It examines cloud disaster recovery systems' application benefits and deployment considerations, featuring elastic resources, redundancy, and automated failover process. Also, the document surveys the replication set of technologies such as storage level replication, database replication, and file system replication, facilitating real-time cross-site synchronizations. Moreover, the study looks into automated failover operations that detect and execute failure recovery courses, such as load-balancing traffic redirecting to backup sites. In addition, the guide highlights the part played by the operation/automation framework in centralizing control and coordination of disaster recovery processes, linking them with monitoring and alerting systems, and guaranteeing that the recovery methods are properly executed. By looking into the issues, best practices, and consequences of making these automated strategies, this paper hopes to give fintech organizations many valuable hints and practical recommendations about how to improve the level of their disaster management, the amount of lost data, and the continuity of their business in unfamiliar damaging episodic situations.

DIGITAL ENTERPRISE MANAGEMENT IN CYBERSPACE

The article describes the results of a study of cybernetic enterprise management based on the model and technology of digital twin and the concept of IEM (intelligent enterprise managing) system. The digital twin model is a meta-model of a real enterprise and a digital enterprise, that exchange information and informationally interact with each other. Cybernetic management is a stage in the development of digital management. The article formalizes the basic principles of cybernetic management. It is shown, that the “mirroring” technology, borrowed from their theory of database replication, is based on the double enterprise model. This mirroring allows to reflect all real processes in cyberspace. In cyberspace, based on a system of standardized management and standardization rules, optimal production processes are modeled and transferred to a real enterprise. The article describes a virtual conveyor model, that is built as an analogue of value chains. It is shown, that the set of virtual conveyors forms a kind of artificial neural network.

Sistem Replikasi Basis Data berdasarkan MySQL menggunakan Container Docker

This study aims to implement database replication using the master-slave technique. The main focus of this research is to run data replication on the master server so that it can be copied automatically on the slave server. Master-slave replication techniques aim to prevent data loss from system failure events or device damage on the main server. The concept of master-slave replication is to copy data from the master server database to the slave server so that users do not need to manually backup data from the database. Master-slave database replication is one of the features provided by the MySQL database application in the Docker container. Still, to run the replication system, some adjustments and configurations are required for the database application to establish a replication infrastructure automatically. In this study, the replication was run on a MySQL database application with 20 multimedia data files capacity of 100MB. Testing is done by entering data into the database on the master server. The test scenario in this study was to upload data and delete data. The test results show that the data changes automatically: the data on the slave server is the same as on the master server, even though the data on the master server has gone through data uploads and deletions. And vice versa, data changes made on the master server are also directly replicated on the slave server.

An automate failure recovery for synchronous distributed database system

Periodically, researchers have been sharing their constant attempts to improve the existing methods for data replication in distributed database system. The main goal is to work for an efficient distributed environment. An efficient environment may handle huge amount of data and preserve data availability. The occasionally failures in distributed systems will affect the end results, such as data loss, income loss etc. Thus, to prevent the data loss and guarantee the continuity of the business, many organizations have applied disaster recovery solutions in their system. One of the widely used is database replication, because it guarantees data safety and availability. However, disaster still can occur in database replication. Hence, an automatic failure recovery technique called distributed database replication with fault tolerance (DDR-FT) has been proposed in this research. DDR-FT uses heartbeat message for node monitoring. Subsequently, a foundation of binary vote assignment for fragmented database (BVAFD) replication technique has been used. In DDR-FT, the data nodes are continuously monitored while auto reconfiguring for automatic failure recovery. From the conducted experiments, it is proved that DDR-FT can preserve system availability. It shows that DDR-FT technique provides a convenient approach to system availability for distributed database replication in real time environment.

Index Key Compression and On-the-Fly Reconstruction of In-Memory Indexes

This article proposes an index key compression scheme based on the notion of distinction bits. It proves that the distinction bits of index keys are sufficient information to determine the sorted order of the index keys. The actual compression ratio may vary depending on the characteristics of datasets (an average of 2.76:1 compression ratio was observed in the authors’ experiments). However, the index key compression scheme leads to significant performance improvements during the reconstruction of large-scale indexes. This study’s index key compression can be effectively used for database replication and index recovery in modern main-memory database systems.

Protecting Networks with Intelligent Diodes

This paper explores the utility, practical nuances, performance characteristics, and attendant security risks associated with intelligent Diodes -- network appliances that regulate traffic flow by validating formats and mission payloads within the security perimeter afforded by a single Field Programmable Gate Array (FPGA). Diodes operate in the middle-ground between networks that are fully air-gapped -- i.e., completely disconnected from the Internet -- and those that are fully connected but require complex boundary defenses and security administration. As such, they provide an all-hardware, real-time alternative for protecting military vehicles and sensitive networks. Diodes are particularly useful in four core settings: when industrial plant need be connected to cloud-analytic services, such as Google-Analytics, for the purpose of process optimization; for supporting the lifecycle of military vehicles through Condition-based Maintenance; for preventing information bleed when sensor feeds must be consumed inside sensitive networks; and finally, for the reliable distributed replication of large files and databases. The devices may operate directly on protocol-specific traffic headers to dispatch or block traffic. Alternatively, they may be customized to validate file and traffic formats. This is achieved using an automated circuit design workflow that builds a hardware parsing plugin from a formal grammar and embeds it into the FPGA. This results in custom hardware that intelligently operates on mission specific data.

Hihooi: A Database Replication Middleware for Scaling Transactional Databases Consistently

With the advent of the Internet and Internet-connected devices, modern business applications can experience rapid increases as well as variability in transactional workloads. Database replication has been employed to scale performance and improve availability of relational databases but past approaches have suffered from various issues including limited scalability, performance versus consistency tradeoffs, and requirements for database or application modifications. This paper presents Hihooi, a replication-based middleware system that is able to achieve workload scalability, strong consistency guarantees, and elasticity for existing transactional databases at a low cost. A novel replication algorithm enables Hihooi to propagate database modifications asynchronously to all replicas at high speeds, while ensuring that all replicas are consistent. At the same time, a fine-grained routing algorithm is used to load balance incoming transactions to available replicas in a consistent way. Our thorough experimental evaluation with several well-established benchmarks shows how Hihooi is able to achieve almost linear workload scalability for transactional databases.

Performance Comparison between NoSQL (RethinkDB) and MySQL Database Replication from Master to Slave in Big Data

When database is stored in one computer or server, certain issues related to disaster (in terms of natural or un-natural) problem may arise with reference to geographical connection and geographical distribution of servers. Here, replication feature plays an important role. There were many techniques and methodologies for geographically distributed servers, but the problem was of one master. When an authorized user updates his database on a client database server then this client database server updates his master database server and at last, the master database server updates all its client’s database servers. The described process is called database replication. In this process, there are several main parameters that are important, i.e., bandwidth, memory, and processor time. In this paper, the analysis is focused on comparing which database (NoSQL family-RethinkDB and MySQL) utilize how much memory, processor, and time during replication of database from client to master.

RocksDB: Evolution of Development Priorities in a Key-value Store Serving Large-scale Applications

This article is an eight-year retrospective on development priorities for RocksDB, a key-value store developed at Facebook that targets large-scale distributed systems and that is optimized for Solid State Drives (SSDs). We describe how the priorities evolved over time as a result of hardware trends and extensive experiences running RocksDB at scale in production at a number of organizations: from optimizing write amplification, to space amplification, to CPU utilization. We describe lessons from running large-scale applications, including that resource allocation needs to be managed across different RocksDB instances, that data formats need to remain backward- and forward-compatible to allow incremental software rollouts, and that appropriate support for database replication and backups are needed. Lessons from failure handling taught us that data corruption errors needed to be detected earlier and that data integrity protection mechanisms are needed at every layer of the system. We describe improvements to the key-value interface. We describe a number of efforts that in retrospect proved to be misguided. Finally, we describe a number of open problems that could benefit from future research.

Combining state- and event-based semantics to verify highly available applications

Replicated databases are attractive for managing the data of distributed applications. To achieve high availability, low latency, and high throughput for such applications, consistency has to be weakened. This comes at a price: it is harder to prove application correctness. In this paper, we describe a new and powerful specification and verification technique for highly available applications together with the tool Repliss that partially automates its use. The verification technique is based on existing event-based semantics for database replication and embeds the semantics into a classical state-based verification approach for application programs. As a central contribution, we carefully designed the specification and programming framework in such a way, that the complex concurrent semantics are reduced to sequential verification, which is much easier to handle and provide a better basis for automated tool support. We prove the soundness of this reduction and a restricted form of completeness. All these proofs and the underlying semantics of the system have been formalized in Isabelle/HOL. • Composable proof technique for working with weak consistency. • Expressible specifications with history invariants. • Semantics, technique, and soundness proof verified in Isabelle/HOL. • Implementation of a prototype verification tool to support the technique.

A Multi-Replica Centered Commit Protocol for Distributed Real-Time and Embedded Applications

Modern multi-site database applications are not only time-driven but also require efficient quality of services with no single-node failure. It might be ideally achieved using database replication techniques. The transactions, being a basic component of these applications, are more likely to miss their deadlines because of requiring unpredictably long time to access remote data items. The temporal validity of data is another issue requiring attention to be paid. To address these problems, a Cluster-Replicas with Efficient Distributed Lazy Update (CRED) protocol is proposed in this paper. The CRED protocol increases the chance of timely execution of transactions and data freshness in an unpredictable workload environment by utilizing the lazy replica update strategy. It reduces the negative impact of the burst workload with a marginal overhead of ensuring timely-updated replicas. The simulation results confirm that the CRED outperforms the ORDER protocol by up to 4%.

A Multi-Replica-Centered Commit Protocol for Distributed Real-Time and Embedded Applications

Modern multi-site database applications are not only time-driven but also require efficient quality of services with no single-node failure. It might be ideally achieved using database replication techniques. The transactions, being a basic component of these applications, are more likely to miss their deadlines because of requiring unpredictably long time to access remote data items. The temporal validity of data is another issue requiring attention to be paid. To address these problems, a Cluster-Replicas with Efficient Distributed Lazy Update (CRED) protocol is proposed in this paper. The CRED protocol increases the chance of timely execution of transactions and data freshness in an unpredictable workload environment by utilizing the lazy replica update strategy. It reduces the negative impact of the burst workload with a marginal overhead of ensuring timely-updated replicas. The simulation results confirm that the CRED outperforms the ORDER protocol by up to 4%.

Online monitoring of water pollution level based on dissolved oxygen (DO) and biochemical oxygen demand (BOD) using wireless sensor system

In the case of water pollution, including the sea, rivers, lakes, and reservoirs, usually when measuring the parameter of Dissolved Oxygen (DO) and Biochemical Oxygen Demand (BOD) values exceeds the pollution level. Online and continuous monitoring is essential to monitor water conditions so that if there is pollution, it can be immediate handling. Wireless sensor network technology becomes part of the Internet of Things makes it possible for online data acquisition from several node stations that are spread in monitoring locations. This paper purpose the online BOD dan DO data acquisition continuously builds with combine the wireless sensor system and database replication concept. From implementing a database replication method for online monitoring of water pollution level, database replication continuously ensures consistency and prevents redundant data between node sensor station and server database, and provides reliable information on the www website.

Comparison of JSON and XML Data Formats in Document Stored NoSql Database Replication Processes

The current trend of solutions in storing large amounts of data is using the NoSQL Database. A document stored is one type of NoSQL database that uses the JavaScript Object Notation (JSON) and eXtensible Markup Language (XML) data formats in data storage. High Availability database is significant to support cloud-based applications and services. Replication is one solution to maintain the consistency of source data and target data. This study aims to determine the performance of JSON and XML data formats in the document stored NoSQL Database replication process. In this study, ArangoDB, RethinkDB, and MongoDB were chosen for use in the trial process of replication from master-server to slave-server with two different data formats, JSON and XML. Data transfer, CPU usage, memory usage, and execution time are measured in each trial. Based on research and experiments that have been carried out, the JSON data format consumes bandwidth with an average value smaller than the XML data format; this occurs in MongoDB, CouchDB, and RethinkDB. In CPU usage, JSON data format, on average, consumes less CPU compared to the XML data format. This is the case with MongoDB. While on CouchDB and RethinkDB, the average CPU usage for XML and JSON data formats does not show a significant difference. The average memory usage for the JSON data format is smaller than the XML data format. The average execution time of the XML data format a little faster than the JSON data format.

Data Replication Using Data Mining Techniques

Database Replication is the successive electronic duplicating of information from a database in one PC or server to a database in another with the goal that all clients share a similar dimension of data. The outcome is a conveyed database in which clients can get to information significant to their assignments without meddling with crafted by others. Anyway information replication is an entrancing theme for both hypothesis and practice. On the hypothetical side, numerous solid outcomes requirement what should be possible as far as consistency: e.g., the difficulty of achieving agreement in offbeat frameworks the blocking idea of CAP hypothesis, and the requirement for picking an appropriate rightness foundation among the numerous conceivable. On the pragmatic side, information replication assumes a key job in a wide scope of settings like storing, back-up, high accessibility, wide territory content dissemination, expanding versatility, parallel preparing, and so forth. Finding a replication arrangement that is reasonable in whatever number such settings as could reasonably be expected remains an open test.

Design for the distributed data locator service for multi-site data repositories

The Remote Experimentation Centre (REC) in Japan has been preparing to replicate the full dataset of ITER over 10 000 km distance. In such a multi-site data repository environment, the data location informing service will be essential to find and retrieve the data efficiently. Considering the long latency time and the self sustainability of remote sites, the data location database should be running at each repository site. Multi-master asynchronous replication between cooperating databases will be essential to realize the remote experimental collaborations in fusion research. This study has investigated the functional differences of some relational databases and found that Postgres BDR has the expected database replication capabilities. Bi-directional replication (BDR) tests by using the LHD database and SNET revealed that the throughputs are sufficient for remote collaborations in fusion experiments.