Redistributing Fragments into a Distributed Database

  • Leon Țâmbulea Babeș Bolyai University, Cluj-Napoca Faculty of Mathematics and Computer Science Department of Computer Science M.Kogãlniceanu No.1
  • Manuela Horvat-Petrescu Babeș Bolyai University, Cluj-Napoca Faculty of Mathematics and Computer Science Department of Computer Science M.Kogãlniceanu No.1

Abstract

A distributed system database performance is strongly related to the fragment allocation in the nodes of the network. An heuristic algorithm for redistributing the fragments is proposed. The algorithm uses the statistical information relative to the requests send to a distributed database. This algorithm minimizes the size of the data transferred for solving a request. Assuming that a distribution of the fragments in the nodes of a network is known, the algorithm generates a plan to transfer data fragments, plan that will be used to evaluate a request.

References

[1] C.H. Cheng,W.K. Lee, K.F.Wong, "A Genetic Algorithm-Based Clustering Approach for Database Partitioning", IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Reviews, 32: 215-230, 2002.
http://dx.doi.org/10.1109/TSMCC.2002.804444

[2] R. Diestel, "Graph Theory", Springer-Verlag, Heidelberg 2000, Electronic Edition.

[3] J. Graham, "Efficient Allocation in Distributed Object Oriented Databases", Proceedings of the ISCA 16th International Conference on parallel and Distributed Computing Systems, Reno Nevada, August 2003.

[4] Y. Huang, J. Chen, "Fragment Allocation in Distributed Database Design", Fragment Allocation in Distributed Database Design, Journal Of Information Science And Engineering, 17, 491-506 (2001).

[5] I. Lungu, A. G. Fodor, "Optimizing Queries in Distributed Systems," Revista Informatica Economica nr. 1 (37), 67-72, 2006.

[6] M. T. Õzsu and P. Valduriez, "Principles of Distributed Database Systems", 2nd ed., Prentice-Hall International Editions, 1999.

[7] A. Sleit, W. AlMobaideen, S. Al-Areqi, A. Yahya, "A Dynamic Object Fragmentation and Replication Algorithm In Distributed Database Systems", American Journal of Applied Sciences 4 (8), 613-618, 2007.
http://dx.doi.org/10.3844/ajassp.2007.613.618

[8] L. Tâmbulea, M. Horvat, "Dynamic Distribution Model in Distributed Database", Int. J. of Computers, Com- munications & Control, ISSN 1841-9836, E-ISSN 1841-9844, Vol. III (2008), Suppl. issue: Proceedings of ICCCC 2008, pp. 512-515.

[9] T. Ulus, M. Uysal, "Heuristic Approach to Dynamic Data Allocation in Distributed Database Systems", Pak- istan Journal of Information and Technology 2 (3), 231-239, 2003.
http://dx.doi.org/10.3923/itj.2003.231.239

[10] S. Upadhyaya, S. Lata, "Task allocation in Distributed computing VS distributed database systems: A Comparative study", IJCSNS International Journal of Computer Science and Network Security , VOL.8 No.3, March 2008.

[11] O. Wolfson, S. Jajodia, "An Algorithm for Dynamic Data Distribution", Proceedings of the 2nd Workshop on the Management of Replicated Data (WMRD-II) , Monterey, CA, Nov. 1992.
http://dx.doi.org/10.1109/mrd.1992.242616
Published
2008-12-01
How to Cite
ȚÂMBULEA, Leon; HORVAT-PETRESCU, Manuela. Redistributing Fragments into a Distributed Database. INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, [S.l.], v. 3, n. 4, p. 384-394, dec. 2008. ISSN 1841-9844. Available at: <http://univagora.ro/jour/index.php/ijccc/article/view/2406>. Date accessed: 27 sep. 2020. doi: https://doi.org/10.15837/ijccc.2013.4.2406.

Keywords

distributed database, fragment allocation, allocation algorithm, transfer cost, heuristic algorithm, redistribution algorithm