Abstract
Large amounts of data have been produced at a rapid rate since the invention of computers. This condition is the key motivation for up-to-date and forthcoming research frontiers. Replication is one of the mechanisms for managing data, since it improves data accessibility and reliability in the distributed database environment. In recent years, the amount of various data grows rapidly with widely available low-cost technology. Although we have been packed with data, we still have lacked of knowledge. Nevertheless, if the impractical data is used in database replication, this will cause waste of data storage and the time taken for a replication process will be delayed. This paper proposes Binary Vote Assignment on Grid Quorum with Association Rule (BVAGQ-AR) algorithm in order to handle fragmented database synchronous replication. BVAGQ-AR algorithm is capable for partitioning the database into disjoint fragments. Fragmentation in distributed database is very useful in terms of usage, reliability and efficiency. Managing fragmented database replication becomes a concern for the administrator because the distributed database is disseminated into split replica partitions. The result from the experiment shows that handling fragmented database synchronous replication through proposed BVAGQ-AR algorithm able to preserve data consistency in distributed environment.
Highlights
Large amounts of data have been produced at a rapid rate since the invention of computers
The total job execution time to update data between five existing techniques namely Dynamic Replication based on the Correlation of the File Strategy in Multi-Tier Data Grid Algorithm (BSCA) [5], A Prefetching-Based Replication Algorithm (PRA) [6], Hierarchical Replication Scheme (HRS) [7], Branch Replication Scheme (BRS) [7] and Read-One-Write-All (ROWA) [8], [9] have been compared with the proposed technique
BVAGQ-AR only took only 66.548 milliseconds to complete a transaction while the second lowest execution time is BCSA with 88.404 milliseconds followed by PRA with total time taken is 96.711 milliseconds
Summary
Large amounts of data have been produced at a rapid rate since the invention of computers. Fragmentation replication is designed to enhance the data availability and the system performance of the distributed database for data management [3]. In order to maintain consistency among the updates by clients, all blocks are propagated and locked during the transaction process This means only one client can modify the data at a time. Only a small number of works have applied data mining techniques to discover file correlations in data grids [13]. The Binary Vote Assignment on Grid (BVAG) has been proposed in order to increase write query availability with low communication cost through the small replication quorum [21]. This paper proposes Binary Vote Assignment on Grid Quorum with Association Rule (BVAGQ-AR) algorithm in order to handle fragmented database synchronous replication.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
