Data Allocation in Distributed Database based on CSO
Article Sidebar
Main Article Content
Abstract
Distributed databases (DDBs) provide smart processing of large databases, the problems of fragmentation and allocation are vital design problems in addition to the centralized design. The majority of performance degradation in DDBs is due to the communication cost by query remote access and retrieval of data. This can be optimized through an efficient data allocation approach that will provide flexible retrieval of a query by low cost accessible sites. In this paper, a novel high performance data allocation approach is designed using Chicken Swarm Optimization (CSO) algorithm. Data allocation problem (DAP) is a NP-Hard problem modelled as optimization problem. The proposed data allocation approach initially characterizes the DAP into optimal problem of choosing the appropriate and minimal communication cost provoking sites for the data fragments. Then the CSO algorithm optimally chooses the sites for each of the data fragments without creating much overhead and data route diversions. This enhances the overall distributed database design and subsequently ensures quality replication. The experimental results illustrate that the proposed CSO based intelligent data fragment allocation approach has better performance than most existing approaches and thus signifies the impact of efficient data allocation in DDBs.
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Tikrit Journal of Pure Science is licensed under the Creative Commons Attribution 4.0 International License, which allows users to copy, create extracts, abstracts, and new works from the article, alter and revise the article, and make commercial use of the article (including reuse and/or resale of the article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made, and the licensor is not represented as endorsing the use made of the work. The authors hold the copyright for their published work on the Tikrit J. Pure Sci. website, while Tikrit J. Pure Sci. is responsible for appreciate citation of their work, which is released under CC-BY-4.0, enabling the unrestricted use, distribution, and reproduction of an article in any medium, provided that the original work is properly cited.
References
[1] Özsu, M. T., & Valduriez, P. (2011). “Principles of distributed database systems.” Springer Science & Business Media.
[2] Elmasri, R., & Navathe, S.(2010). “Fundamentals of database systems.” Addison-Wesley Publishing Company.
[3] Coronel, C., & Morris, S. (2016). “Database systems: design, implementation, & management.” Cengage Learning.
[4] Virk, R. S., & Singh, D. G. (2011). “Optimizing access strategies for a distributed database design using genetic fragmentation.” IJCSNS International Journal of Computer Science and Network Security, 11(6).
[5] Hababeh, I., Bowring, N., & Ramachandran, M. (2005). “A method for fragment allocation design in the distributed database systems.” In The Sixth Annual UAE University Research Conference.
[6] Basseda, R., Tasharofi, S., & Rahgozar, M. (2006). “Near neighborhood allocation (nna): A novel dynamic data allocation algorithm in ddb.” In proceedings of 11th Computer Society of Iran Computer Conference (CSICC2006), Tehran.
[7] Loiola, E. M., de Abreu, N. M. M., Boaventura-Netto, P.O., Hahn, P., & Querido, T.(2007). “A survey for the quadratic assignment problem. ” European journal of operational research, 176(2), 657-690.
[8] Cela, E. (2013). “The quadratic assignment problem: theory and algorithms” (Vol. 1). Springer Science & Business Media.
[9] Tosun, U. (2014). “Distributed database design using evolutionary algorithms.” Journal of Communications and Networks, 16(4), 430-435.
[10] Meng, X., Liu, Y., Gao, X., & Zhang, H. (2014). “A new bio-inspired algorithm: chicken swarm optimization.” In International conference in swarm intelligence (pp. 86-94). Springer, Cham.
[11] Mukherjee, N. (2011). “Synthesis of non-replicated dynamic fragment allocation algorithm in distributed database systems.” ACEEE Int. J. on Information Technology, 1(01).
[12] Li, S. P., & Wong, M. H. (2013). “Data allocation in scalable distributed database systems based on time series forecasting.” In 2013 IEEE International Congress on Big Data (BigData Congress), (pp. 17-24). IEEE.
[13] Singh, A. (2016). “Empirical Evaluation of Threshold and Time Constraint Algorithm for Non-replicated Dynamic Data Allocation in Distributed Database Systems.” In Proceedings of the International Congress on Information and Communication Technology (pp. 131-138). Springer, Singapore.
[14] Gu, S., Zhuge, Q., Yi, J., Hu, J., & Sha, E. H. M. (2016). “Data allocation with minimum cost under guaranteed probability for multiple types of memories.” Journal of Signal Processing Systems, 84(1), 151-162.
[15] Abdalla, H. I. (2012). “A new data re-allocation model for distributed database systems. ”International Journal of Database Theory and Application, 5(2), 45-60.
[16] Sun, Q., Deng, B., Fu, L., & Sun, J. (2017). “Non-redundant Distributed Database Allocation Technology Research.” In 2017 International Conference on Computing Intelligence and Information System (CIIS), (pp. 155-159). IEEE.
[17] Lwin, N. K. Z., & Naing, T. M. (2018). “Non-Redundant Dynamic Fragment Allocation with Horizontal Partition in Distributed Database System.” In 2018 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS) (Vol. 3, pp. 300-305). IEEE.
[18] Chen, W., Paik, I., Li, Z., & Yen, N. Y. (2018). “A cost minimization data allocation algorithm for dynamic datacenter resizing.” Journal of Parallel and Distributed Computing, 118, 280-295.
[19] Al-Sayyed, R. M., Al Zaghoul, F. A., Suleiman, D., Itriq, M., & Hababeh, I. (2014). “A new approach for database fragmentation and allocation to improve the distributed database management system performance.” Journal of Software Engineering and Applications, 7(11), 891.
[20] Rahmani, S., Torkzaban, V., & Haghighat, A. T. (2009). “A new method of genetic algorithm for data allocation in distributed database systems.” In First International Workshop on Education Technology and Computer Science, 2009. ETCS'09. (Vol. 1, pp. 1037-1041). IEEE.
[21] Zhao, C., Gao, J., & Ma, X. (2011). “A Genetic Algorithm for Data Allocation of Distributed Database System in Delay-Sensitive Network. ” Journal of Information &Computational Science, 8(15), 3737-3745.
[22] Mamaghani, A. S., Mahi, M., & Meybodi, M. R. (2010). “A learning automaton based approach for data fragments allocation in distributed database systems.” In 2010 IEEE 10th International Conference on Computer and Information Technology (CIT), (pp. 8-12). IEEE.
[23] Mamaghani, A. S., Mahi, M., Meybodi, M. R., & Moghaddam, M. H. (2010). “A novel evolutionary algorithm for solving static data allocation problem in distributed database systems.” In 2010 Second International Conference on Network Applications, Protocols and Services(pp. 14-19). IEEE.
[24] Tosun, U., Dokeroglu, T., & Cosar, A. (2013). “Heuristic algorithms for fragment allocation in a distributed database system.” In Computer and Information Sciences III (pp. 401-408). Springer, London.
[25] Singh, A., Kahlon, K. S., & Virk, R. S. (2014). “Nonreplicated static data allocation in distributed databases using biogeography-based optimization.’ Chinese Journal of Engineering, 2014.
[26] Mahi, M., Baykan, O. K., & Kodaz, H. (2018). “A new approach based on particle swarm optimization algorithm for solving data allocation problem.” Applied Soft Computing, 62, 571-578.
[27] Grillo, R. (2014). ‘Chicken Behavior: An Overview of Recent Science.”
[28] Smith, C.L., & Zielinski, S.L. (2014). “The Startling Intelligence of the Common Chicken.” Scientific American 310(2)..