Clustered Approach to Dynamic Data Allocation in Distributed Database Systems

Article Sidebar

PDF
Published: Jun 23, 2017
DOI: https://doi.org/10.26483/ijarcs.v8i5.3935
Keywords:
Distributed database system, Redundant and non-redundant, Dynamic data allocation, Cluster of sites, DDS performance.

Main Article Content

Raju Kumar
Research Scholar, Department of Computer Science, Gurukul Kangri Vishwavidyalaya, Haridwar, India
Neena Gupta
Assistant Professor, Department of Computer Science, Kanya Gurukul Mahavidyalaya Dehradun (Second Campus of Gurukul Kangri Vishwavidyalaya, Haridwar), India

Abstract

Distributed database is very much popular in organizations which are distributed and operating from multiple geographic locations. The two important issues to improve the performance of distributed database systems (DDS) are - grouping of different sites into clusters, and dynamic reallocation of data fragment to these clusters. Clustering network sites and data allocation are still open research problems as their optimal solution is NP-hard. The prime contribution in this field is to develop a near optimal solution. In this paper a new algorithm is proposed for clustering distributed database sites based on the distance between sites to minimise the number of communications and network overhead between sites. Moreover, a Clustered Approach to Dynamic Data Allocation (CADDA) algorithm is proposed to dynamically reallocate data fragments to clusters in redundant and non-redundant distributed database system to reduce the remote data accesses and network overhead. The proposed approach is implemented on a sample distributed database system and compared with other cluster and non-cluster based data allocation algorithms. The comparison results show that proposed approach efficiency is better and it improves the overall performance of the distributed database system.

Downloads

Download data is not yet available.

Article Details

Issue
Vol. 8 No. 5 (2017): May-June 2017
Section
Articles

COPYRIGHT

Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
  • The journal allows the author(s) to retain publishing rights without restrictions.
  • The journal allows the author(s) to hold the copyright without restrictions.
Author Biographies

Raju Kumar, Research Scholar, Department of Computer Science, Gurukul Kangri Vishwavidyalaya, Haridwar, India

Research Scholar, Department of Computer Science, Gurukul Kangri Vishwavidyalaya, Haridwar, India

Neena Gupta, Assistant Professor, Department of Computer Science, Kanya Gurukul Mahavidyalaya Dehradun (Second Campus of Gurukul Kangri Vishwavidyalaya, Haridwar), India

Assistant Professor, Department of Computer Science, Kanya Gurukul Mahavidyalaya Dehradun (Second Campus of Gurukul Kangri Vishwavidyalaya, Haridwar), India

References

M.T. Ozsu, P. Valduriez, “Principles of Distributed Database Systems,†3rd edn. Springer Science+Business Media, LLC 2011: New York, USA, 2011.

S. Ceri, G. Pelagatti, “Distributed Databases: Principles & Systems,†edn. 2008. McGraw-Hill International: New Delhi, India, 2008.

I. Hababeh, M. Ramachandran, N. Bowring, “A high-performance computing method for data allocation in distributed database systems,†J Supercomput. 2007; 39(1): 3–18.

I. Hababeh, “Improving network systems performance by clustering distributed database sites,†The Journal of Supercomputing, 2012; 59: 249-267.

R.M.H Al-Sayyed, F.A Al-Zaghoul, D. Suleiman, M. Itriq, I. Hababeh, “A new approach for database fragmentation and allocation to improve the distributed database management system performance,†Journal of Software Engineering and Applications. 2014; 7: 891-905.

N. Mukharjee, “Non-replicated dynamic fragment allocation in distributed database systems,†Springer-Verlag Berlin Heidelberg, CCSIT, Part I, CCIS 131, Bangalore, Jan. 2011, 560-569.

T. Ulus, M. Uysal, “Heuristic approach to dynamic data allocation in distributed database systems,†Pakistan Journal of Information and Technology. 2003; 2(3): 231-239.

A. Singh, K.S Kahlon, “Non-replicated dynamic data allocation in distributed database systems,†International Journal of Computer Science and Network Security, 2009; 9(9): 176-180.

S. Kamali, P. Ghodsnia, K. Daudjee, “Dynamic data allocation with replication in distributed systems,†IEEE Explore, 2011, 978-1-4673-0012-4/11/$26.00.

H.I Abdalla, “A new data re-allocation model for distributed database systems,†International Journal of Database Theory and Application. 2012; 5(2): 45-59.

A.A Amer, H.I Abdalla, “A heuristic approach to re-allocate data fragments in DDBSs,†Information Technology and e-Services (ICITeS) Int. Conf., Sousse, Tunisia, March 2012, 01-06.

Y. Zhu, J. Liu, M. Guo, W. Ma, G. Yi, Y. Bao, “ACIA, not ACID: conditions, properties and challenges,â€

arXiv:1701.07512v2 [cs.DC], 2017 January; 1-8.

R. Kumar, “Distributed database security: issues and challenges,†Proceedings of Int. Conf. Computing: Updates & Trends, Ghaziabad, India, 2010, 301-309.

R. Kumar, N. Gupta, “An extended approach to non-replicated dynamic fragment allocation in distributed database systems,†IEEE Xplore, ICICT, Ghaziabad, India, 2014, 861-865.

R. Kumar, N. Gupta, “An extended efficient approach to dynamic fragment allocation in distributed database systems,†International Journal of Control Theory and Applications (IJCTA). 2016; 9(20): 473-482.

R. Kumar, N. Gupta, “Non-redundant dynamic data allocation in distributed database systems,†International Journal of Computer Applications, 2012; Special Issue on ICNICT, 6: 06-10.

R. Kumar, N. Gupta, “Dynamic data allocation in distributed database systems: a systematic survey,†International Review on Computers and Softwares, 2013; 8(2): 660-667.