BVAGQ-AR for Fragmented Database Replication Management

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.

[1]  Indranil Gupta,et al.  New Worker-Centric Scheduling Strategies for Data-Intensive Grid Applications , 2007, Middleware.

[2]  Nima Jafari Navimipour,et al.  A comprehensive review of the data replication techniques in the cloud environments: Major trends and future directions , 2016, J. Netw. Comput. Appl..

[3]  Roslina Mohd Sidek,et al.  Lowest Data Replication Storage of Binary Vote Assignment Data Grid , 2010, NDT.

[4]  Rakesh Agrawal,et al.  Parallel Mining of Association Rules , 1996, IEEE Trans. Knowl. Data Eng..

[5]  Ahmed N. Abdalla,et al.  Data Replication Using Read-One-Write-All Monitoring Synchronization Transaction System in Distributed Environment , 2010 .

[6]  Shyamala Doraimani,et al.  Filecules: A New Granularity for Resource Management in Grids , 2007 .

[7]  Junzhou Luo,et al.  A Prefetching-based Replication Algorithm in Data Grid , 2008, 2008 Third International Conference on Pervasive Computing and Applications.

[8]  Mohammed J. Zaki.  Data Mining and Analysis: Fundamental Concepts and Algorithms , 2014 .

[9]  Shojiro Nishio,et al.  Data management issues in mobile and peer-to-peer environments , 2002, Data Knowl. Eng..

[10]  Sinan Q. Salih,et al.  An Enhanced Version of Black Hole Algorithm via Levy Flight for Optimization and Data Clustering Problems , 2019, IEEE Access.

[11]  David J. Evans,et al.  Binary vote assignment on a grid for efficient access of replicated data , 2003, Int. J. Comput. Math..

[12]  Tarek Hamrouni,et al.  A survey of dynamic replication and replica selection strategies based on data mining techniques in data grids , 2016, Eng. Appl. Artif. Intell..

[13]  Tarek Hamrouni,et al.  A Critical Survey of Data Grid Replication Strategies Based on Data Mining Techniques , 2015, ICCS.

[14]  Julio J. Valdés,et al.  Data Mining Meets Grid Computing: Time to Dance? , 2009 .

[15]  Jun Wang,et al.  A new reliability model in replication-based big data storage systems , 2017, J. Parallel Distributed Comput..

[16]  Sharifah Hafizah Sy Ahmad Ubaidillah,et al.  FRAGMENTATION TECHNIQUES FOR IDEAL PERFORMANCE IN DISTRIBUTED DATABASE – A SURVEY , 2020, International Journal of Software Engineering and Computer Systems.

[17]  Justin Chu,et al.  DIDA: Distributed Indexing Dispatched Alignment , 2015, PloS one.

[18]  Jesús Carretero,et al.  Branch replication scheme: A new model for data replication in large scale data grids , 2010, Future Gener. Comput. Syst..

[19]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[20]  I-Ling Yen,et al.  A data management framework for secure and dependable data grid , 2006 .