Reducing transfer costs of fragments allocation in replicated distributed database using genetic algorithms

• Autorzy: Sourati N. K , Ramezni F
• Języki publikacji: EN

Abstrakty

EN

Distributed databases were developed in order to respond to the needs of distributed computing. Unlike traditional database systems, distributed database systems are a set of nodes that are connected with each other by network and each of nodes has its own database, but they are available by other systems. Thus, each node can have access to all data on entire network. The main objective of allocated algorithms is to attribute fragments to various nodes in order to reduce the shipping cost. Thus, firstly fragments of nodes must be accessible by all nodes in each period, secondly, the transmission cost of fragments to nodes must be reduced and thirdly, the cost of updating all components of nodes must be optimized, that results in increased reliability and availability of network. In this study, more efficient hybrid algorithm can be produced combining genetic algorithms and previous algorithms.

Słowa kluczowe

EN

distributed database; genetic algorithms; communication costs; GA; data segmentation; Fitness; Crossover; node; fragment data

• Wydawca: Lublin University of Technology ; Polish Society of Ecological Engineering (PTIE), Branch of PTIE in Lublin
• Czasopismo: Advances in Science and Technology. Research Journal
• Rocznik: 2015
• Tom: Vol. 9, nr 25
• Strony: 1--6
• Opis fizyczny: Bibliogr. 32 poz., fig.

Twórcy

autor

Sourati N. K

• Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran

autor

Ramezni F

• Department of Computer Engineering, Sari Branch, Islamic Azad University, Sari, Iran

Bibliografia

• 1. Hu Y., Chen J., Fragment allocation in distributed database design. Journal of Information Science and Engineering 17, 2001, 491–506.
• 2. Dokeroglu T., Cosar A., Dynamic programming with ant colony optimization meta heuristic for the optimization of distributed database queries. [In:] Proceedings of the 26th International Symposium on Computer and Information Sciences (ISCIS), London 2011.
• 3. Lee Z., Su S., Lee C., A heuristic genetic algorithm for solving resource allocation problems.Knowl. Inf. Syst. 5 (4), 2003, 503–511.
• 4. Schwartz R.A., Kraus S., Negotiation on data allocation in multi-agent environments. Autonomous Agents and Multi-Agent Systems, 5 (2), 2002, 123–172.
• 5. Chin A.G., Incremental data allocation and reallocation in distributed database systems. Journal of Database Management, 12 (1), 2001, 35–45.
• 6. Huang Y.F., Chen J.H., Fragment allocation in distributed database design. Journal of Information Science and Engineering, 17 (3), 2001, 491–506.
• 7. Morgan H.L., Levin K.D., Optimal program and data locations in computer networks. Communications of the ACM, 20 (5), 1977, 315–322.
• 8. Jin Hyun Son, Myoung Ho Kim, An adaptable vertical partitioning method in distributed systems. The Journal of Systems and Software. Elsevier 2003.
• 9. Shemshaki M., Shahhoseini H.S., Energy efficient clustering algorithm with multi-hop transmission. IEEE, Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009, 459–462.
• 10. Wai Gen Yee, Donahoo M.J., Shamkant B., Navathe, A framework for server data fragment grouping to improve server scalability in intermittently synchronized databases. CIKM 2000.
• 11. Chun-Hung Cheng, Wing-Kin Lee, Kam-Fai Wong, A genetic algorithm-based clustering approach for database partitioning. IEEE Transactions on Systems, Man and Cybernetic, Part C: Applications and Reviews, 32 (3), 2002.
• 12. Srinivas M., Patnaik L.M., Genetic Algorithms: A Survey. IEEE Computer, 2002, 17–26.
• 13. An introduction to genetic algorithms. Kanpur Ge¬netic Algorithms Laboratory (KanGAL). Sadhana, 24 (4-5), 1999, 293–315.
• 14. Basseda R., Fragment allocation in distributed database systems. Database Research Group 2006.
• 15. Basseda R., Data allocation in distributed database systems. Technical Report No. DBRG. RB-ST. A50715, 2005.
• 16. Ulus T., Uysal M., Heuristic approach to dynamic data allocation in distributed database systems. Pakistan Journal of Information and Technology 2 (3), 2003, 231–239.
• 17. Baseda S., Tasharofi M.R., Near neighborhood allocation: A novel dynamic data allocation algorithm in DDB, CSICC, 2006.
• 18. Safari A.M., Meybodi M.R., Clustering of software systems using new hybrid algorithms. Proc. Int. Conf. on Computer and Information Technology (CIT 2009), Xiamen, China, 2009, 20–25.
• 19. Oommen B.J., Ma D.C.Y., Deterministic learning automata solutions to the equi partitioning problem. IEEE Trans. on Computers, Vol. 37, 1998, 2–13.
• 20. Ahmed I., Karlapalem K., Kowok Y.K., Evolutionary algorithms for allocating data in distributed database systems. International Journal of Distributed and Parallel Databases, 11 (1), 2002, 5–32.
• 21. Chu W.W., Optimal file allocation in a multiple computer system. IEEE Transactions on Computers, C-18 (10), 1969, 885–889.
• 22. Morgan H.L., Levin K.D., Optimal program and data locations in computer networks. Communications of the ACM, 20 (5), 1977, 315–322.
• 23. Chu W.W. 1969. Optimal file allocation in a multiple computer system. IEEE Transactions on Computers, C-18 (10), 885–889.
• 24. Ishfaq Ahmad, Yu-Kwong Kwok, Siu-Kai So, Distributed and parallel databases. Kluwer Academic Publishers, 11, 2002, 5–32,
• 25. Srinivas M., Patnaik L.M., Genetic algorithms: A survey. Computer, 27 (6), 1994, 17–26.
• 26. Goldberg D.E. 1989. Genetic algorithms in search, optimization and machine learning. Addison-Wesley: Reading, MA.
• 27. Hurley S., Taskgraph mapping using a genetic algorithm: A comparison of fitness functions. Parallel Computing, 19, 1993, 1313–1317.
• 28. Mahfoud S.W., Goldberg D.E., Parallel recombinative simulated annealing: Agenetic algorithm. Parallel Computing, 21, 1995, 1–28.
• 29. Jing L., Michael K.N., Huang J.Z., Knowledge-based vector space model for text clustering. 2009.
• 30. McClean S., Scotney B., Shapcott M., Using domain knowledge to learn from heterogeneous distributed databases. Springer-Verlag, Berlin Heidelberg 2004.
• 31. Xiuxia Yu, Yinghong Dong, Li Yue, A study of optimized algorithm for distributed database half-join query and knowledge engineering. Springer- Verlag, Berlin Heidelberg 2012.
• 32. Moghaddam H., Mamaghani S., Mahi M., Meybodi M., A novel evolutionary algorithm for solving static data allocation problem in distributed database systems. IEEE 2010.