Optimization of Query Processing in Versatile Database Using Ant Colony Algorithm
محورهای موضوعی : Data Mining
hasan Asil
1
(Department of Computer Engineering, Faculty of Electrical and Computer Engineering, Azarshahr Branch, Islamic Azad University, Azarshahr, Iran)
کلید واژه: Database, Ant Colony Algorithm, Query Processing, Versatility, Optimization,
چکیده مقاله :
Nowadays, with the advancement of database information technology, databases has led to large-scale distributed databases. According to this study, database management systems are improved and optimized so that they provide responses to customer questions with lower cost. Query processing in database management systems is one of the important topics that grabs attentions. Until now, many techniques have been implemented for query processing in database system. The purpose of these methods is to optimize query processing in the database. The main topics that is interested in query processing in the database makes run-time adjustments of processing or summarizing topics by using the new approaches. The aim of this research is to optimize processing in the database by using adaptive methods. Ant Colony Algorithm (ACO) is used for solving optimization problems. ACO relies on the created pheromone to select the optimal solution. In this article, in order to make adaptive hybrid query processing. The proposed algorithm is fundamentally divided into three parts: separator, replacement policy, and query similarity detector. In order to improve the optimization and frequent adaption and correct selection in queries, the Ant Colony Algorithm has been applied in this research. In this algorithm, based on Versatility (adaptability) scheduling, Queries sent to the database have been attempted be collected. The simulation results of this method demonstrate that reduce spending time in the database. According to the proposed algorithm, one of the advantages of this method is to identify frequent queries in high traffic times and minimize the time and the execution time. This optimization method reduces the system load during high traffic load times for adaptive query Processing and generally reduces the execution runtime and aiming to minimize cost. The rate of reduction of query cost in the database with this method is 2.7%. Due to the versatility of high-cost queries, this improvement is manifested in high traffic times. In the future Studies, by adapting new system development methods, distributed databases can be optimized.
Nowadays, with the advancement of database information technology, databases has led to large-scale distributed databases. According to this study, database management systems are improved and optimized so that they provide responses to customer questions with lower cost. Query processing in database management systems is one of the important topics that grabs attentions. Until now, many techniques have been implemented for query processing in database system. The purpose of these methods is to optimize query processing in the database. The main topics that is interested in query processing in the database makes run-time adjustments of processing or summarizing topics by using the new approaches. The aim of this research is to optimize processing in the database by using adaptive methods. Ant Colony Algorithm (ACO) is used for solving optimization problems. ACO relies on the created pheromone to select the optimal solution. In this article, in order to make adaptive hybrid query processing. The proposed algorithm is fundamentally divided into three parts: separator, replacement policy, and query similarity detector. In order to improve the optimization and frequent adaption and correct selection in queries, the Ant Colony Algorithm has been applied in this research. In this algorithm, based on Versatility (adaptability) scheduling, Queries sent to the database have been attempted be collected. The simulation results of this method demonstrate that reduce spending time in the database. According to the proposed algorithm, one of the advantages of this method is to identify frequent queries in high traffic times and minimize the time and the execution time. This optimization method reduces the system load during high traffic load times for adaptive query Processing and generally reduces the execution runtime and aiming to minimize cost. The rate of reduction of query cost in the database with this method is 2.7%. Due to the versatility of high-cost queries, this improvement is manifested in high traffic times. In the future Studies, by adapting new system development methods, distributed databases can be optimized.
[1] Saurabh gupta, Gopal Singh Tandel, Umashankar Pandey, "A Survey on Query Processing and Optimization in Relational Database Management System”, International Journal of Latest Trends in Engineering and Technology, Vol. 5 Issue 1 January 2015.
[2] Amol Deshpande, Zachary Ives, and Vijay Shankar Raman. Adaptive query processing. Foundations and Trends in Databases, 1(1), 2007. To appear. January 7-10, 2007, Asilomar, California, USA.
[3] Sybase, Performance and Tuning Series Query Processing and Abstract Plans, Sybase, Inc., One Sybase Drive, Dublin, CA 94568.
[4] Navid mohseni, mehdi mokhtarpor, hosein shirgah,"Application of Ant Colony Algorithm in data mining”, National Conference on Emerging Trends in Computer Engineering and Data Recovery,2014.
[5] Gupta, D.K.; Gupta, J.P.; Arora, Y.; Shankar, U., "Recursive Ant Colony optimization: a new technique for the estimation of function parameters from geophysical field data," Near Surface Geophysics , vol. 11, no. 3, pp.325-339.
[6] Serap Ulusam Seçkiner, Yunus Eroğlu, Merve Emrullah, Türkay Dereli, Ant Colony optimization for continuous functions by using novel pheromone updating, Applied Mathematics and Computation Volume 219, Issue 9, 1 January 2013, Pages 4163-4175.
[7] Xiao. M.Hu, J. ZHANG, and H. Chung, "An Intelligent Testing System Embedded with an Ant Colony Optimization Based Test Composition Method", IEEE Transactions on Systems, Man, and Cybernetics--Part C: Applications and Reviews, Vol. 39, No. 6, pp. 659-669, Dec 2009.
[8] B. Pfahring, "Multi-agent search for open scheduling: adapting the Ant-Q formalism," Technical report TR-96-09, 1996.
[9] A. Shmygelska, R. A. Hernández and H. H. Hoos, "An Ant Colony optimization algorithm for the 2D HP protein folding problem [permanent dead link]," Proceedings of the 3rd International Workshop on Ant Algorithms/ANTS 2002, Lecture Notes in Computer Science, vol.2463, pp.40-52, 2002. [10] Gupta, D.K.; Arora, Y.; Singh, U.K.; Gupta, J.P., "Recursive Ant Colony Optimization for estimation of parameters of a function," Recent Advances in Information Technology (RAIT), 2012 1st International Conference on, vol., no., pp.448-454, 15–17 March 2012 [11] Zhang, Y. (2013). "A Rule-Based Model for Bankruptcy Prediction Based on an Improved Genetic Ant Colony Algorithm". Mathematical Problems in Engineering. 2013: 753251. doi:10.1155/2013/753251.
[12] Jevtić, A.; Melgar, I.; Andina, D. (2009). 2009 35th Annual Conference of IEEE Industrial Electronics. 35th Annual Conference of IEEE Industrial Electronics, 2009. IECON '09. pp. 3353–3358.
doi:10.1109/IECON.2009.5415195. ISBN 978-1-4244-4648-3. S2CID 34664559.
[13] Warner, Lars; Vogel, Ute (2008). Optimization of energy supply networks using Ant Colony optimization (PDF). Environmental Informatics and Industrial Ecology — 22nd International Conference on Informatics for Environmental Protection. Aachen, Germany: Shaker Verlag. ISBN 978-3-8322-7313-2. Retrieved 2018-10-09.
[14] Zaidman, Daniel; Wolfson, Haim J. (2016-08-01). "PinaColada: peptide–inhibitor Ant Colony ad-hoc design algorithm". Bioinformatics. 32 (15): 2289–2296. doi:10.1093/bioinformatics/btw133. ISSN 1367-4803. PMID 27153578.
[15] J. ZHANG, H. Chung, W. L. Lo, and T. Huang, "Extended Ant Colony Optimization Algorithm for Power Electronic Circuit Design", IEEE Transactions on Power Electronic. Vol.24,No.1, pp.147-162, Jan 2009.
[16] L. Wang and Q. D. Wu, "Linear system parameters identification based on Ant system algorithm," Proceedings of the IEEE Conference on Control Applications, pp. 401-406, 2001.
[17] Martins, Jean P.; Fonseca, Carlos M.; Delbem, Alexandre C. B. (25 December 2014). "On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem". Neurocomputing. 146: 17–29. doi:10.1016/j.neucom.2014.04.069. [18] L.M. Gambardella and M. Dorigo, "Solving Symmetric and Asymmetric TSPs by Ant Colonies", Proceedings of the IEEE Conference on Evolutionary Computation, ICEC96, Nagoya, Japan, May 20–22, pp. 622-627, 1996.
[19] Mohammad_Reza Feizi_Derakhshi, Hasan Asil, Amir Asil, “Proposing a New Method for Query Processing Adaption in DataBase, JOURNAL OF COMPUTING,NY,USA, VOLUME 2, ISSUE 1, JANUARY 2010, ISSN 2151-961.
[20] Mohammad_Reza Feizi_Derakhshi, Hasan Asil, Amir Asil " Proposing a New Method for Query Processing Adaption in Data Base " WCSET 2009: World Congress on Science, Engineering and Technology Dubai, United Arab Emirates VOLUME 37, January 28-30, 2009 ISSN 2070-3740.
[21] D. Martens, M. De Backer, R. Haesen, J. VAnthienen, M. Snoeck, B. Baesens, Classification with Ant Colony Optimization, IEEE Transactions on Evolutionary Computation, volume 11, number 5, pages 651—665, 2007.
[22] L.M. Gambardella and M. Dorigo, "Ant-Q: a reinforcement learning approach to the traveling salesman problem", Proceedings of ML-95, Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, pp. 252–260, 1995.
[23] V. Donati, V. Darley, B. Ramachandran, "An Ant-Bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions", book chapter in Advances in Metaheuristics for Hard Optimization, Springer, ISBN 978-3-540-72959-4, pp.111-138, 2008.
[24] Warner, Lars; Vogel, Ute (2008). Optimization of energy supply networks using Ant Colony optimization (PDF). Environmental Informatics and Industrial Ecology — 22nd International Conference on Informatics for Environmental Protection. Aachen, Germany: Shaker Verlag. ISBN 978-3-8322-7313-2. Retrieved 2018-10-09.
[25] A. Deshpande and J. M. Hellerstein. Lifting the burden of history from adaptive query processing. In VLDB, 2004.
[26] Bingsheng He, Qiong Luo,“Cache-Oblivious Query Processing” Biennial Conference on nnovative Data Systems Research (CIDR).
[27] Wanhong Xu, “Xml Query Processing – SemAntic Cache System”, IJCSNS International Journal of Computer Science and Network Security, VOL.7 No.4, April 2007.
[28] Elnaz zafarani , Mohammad_Reza Feizi_Derakhshi , Hasan Asil , Amir Asil “Presenting a New Method for Optimizing Join Queries Processing in Heterogeneous Distributed Databases.
[29] Farhang Pedearan Moghadam, Hamid Maghsoudi, " Improved routing for load balancing in wireless sensor networks on the Internet of things, based on multiple Ant Colony algorithm", " Journal of Information Systems and Telecommunication (JIST) " Number 51, Volume 14 .
[30] Farid Ahmadi ,Mohammad Pourmahmood Aghababa ,Hashem Kalbkhani, Nonlinear Regression Model Based on Fractional Bee Colony Algorithm for Loan Time Series, Journal of Information Systems and Telecommunication (JIST), 2022-04-21, Page: 141 – 1.
[31] Luming Sun, Tao Ji, Cuiping Li, Hong ChenDeepO: A Learned Query Optimizer,SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataJune 2022Pages 2421–2424https://doi.org/10.1145/3514221.3520167.
[32] Ryan Marcus, Parimarjan Negi, Hongzi Mao, Nesime Tatbul, Mohammad Alizadeh, and Tim Kraska. 2021. Bao: Making Learned Query Optimization Practical. Proceedings of the 2021 International Conference on Management of Data (2021).
[33] Kristian F. D. Rietveld and Harry A. G. Wijshoff,Redefining The Query Optimization Process,IEEE TKDE 2022,arXiv:2203.01079v1,January 2022.
[34] Yakov Kuzin, Anna Smirnova, Evgeniy Slobodkin, George Chernishev, Query Processing and Optimization for a Custom Retrieval Language,Proceedings of the First Workshop on Pattern-based Approaches to NLP in the Age of Deep Learning,October,2022.
[35] Mohsin, S.A.; Younes, A.; Darwish, S.M. Dynamic Cost Ant Colony Algorithm to Optimize Query for Distributed Database Based on QuAntum-Inspired Approach. Symmetry 2021, 13, 70. https://doi.org/10.3390/sym13010070.
[36] Zhiyong Ding,Study of Multi Ant Colony Genetic Algorithm in Query Optimization of Distributed Database, 2022 2nd International Conference on Artificial Intelligence and Advanced Manufacture (AIAM),202250,10.52547/jist.16015.10.38.141.
[37] Mladineo, Marko; Veza, Ivica; Gjeldum, Nikola (2017). "Solving partner selection problem in cyber-physical production networks using the HUMANT algorithm". International Journal of Production Research. 55 (9): 2506–2521. doi:10.1080/00207543.2016.1234084. S2CID 114390939.
[38] Atieh Monemi Bidgoli, Hassan haghighi, Using Static Information of Programs to Partition the Input Domain in Search-based Test Data Generation, Journal of Information Systems and Telecommunication (JIST), 2021-01-13, Page: 219 – 229.
[39] L. Bianchi, L.M. Gambardella et M.Dorigo, An Ant Colony optimization approach to the probabilistic traveling salesman problem, PPSN-VII, Seventh International Conference on Parallel Problem Solving from Nature, Lecture Notes in Computer Science, Springer Verlag, Berlin, Allemagne, 2002.
[40] Babu Kumar Ajay Vikram Singh Parul Agarwal, AI based Computational Trust Model for Intelligent Virtual AssistAnt, Journal of Information Systems and Telecommunication (JIST), Issue 32 Vol. 8 Autumn 2020, Page: 263 - 271 10.29252/jist.8.32.263.
[41] P. O’Neil and G. Graefe, “Multi-Table Joins Through Bitmapped Join Indices”, ACM SIGMOD, 1995”, WKDD2010, Phuket, Thailand, 9-10 January, 2010.
[42] Rosa Karimi AdlEmail authorSeyed Mohammad Taghi Rouhani Rankoohi, "A new Ant Colony optimization-based algorithm for data allocation problem in distributed databases", Knowledge and Information Systems, September 2009, Volume 20, Issue 3, pp 349–373.
[43] W. N. Chen and J. ZHANG "Ant Colony Optimization Approach to Grid Workflow Scheduling Problem with Various QoS Requirements", IEEE Transactions on Systems, Man, and Cybernetics--Part C: Applications and Reviews, Vol. 31, No. 1, pp.29-43, Jan 2009.
[44] Jevtić, A.; Quintanilla-Dominguez, J.; Cortina-Janich’s, M.G.; Andina, D. (2009). Edge detection using Ant Colony search algorithm and multiscale contrast enhancement. IEEE International Conference on Systems, Man and Cybernetics, 2009. SMC 2009. pp. 2193–2198. doi:10.1109/ICSMC.2009.5345922. ISBN 978-1-4244-2793-2. S2CID 11654036.
[45] O. Okobiah, S. P. MohAnty, and E. Kougianos, "Ordinary Kriging Metamodel-Assisted Ant Colony Algorithm for Fast Analog Design Optimization Archived March 4, 2016, at the Wayback Machine", in Proceedings of the 13th IEEE International Symposium on Quality Electronic Design (ISQED), pp. 458--463, 2012.
[46] Gupta, D.K.; Arora, Y.; Singh, U.K.; Gupta, J.P., "Recursive Ant Colony Optimization for estimation of parameters of a function," Recent Advances in Information Technology (RAIT), 2012 1st International Conference on , vol., no., pp.448-454, 15–17 March 2012.
[47] Muhammet Dursun Kaya, Hasan Asil, Dynamic Store Procedures in Database, German-Turkish Perspectives on IT and Innovation Management: Challenges and Approaches, 291-301,2018.
