{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T07:23:52Z","timestamp":1788852232592,"version":"build-2803163510"},"reference-count":36,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,1,2]],"date-time":"2021-01-02T00:00:00Z","timestamp":1609545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A distributed database model can be effectively optimized through using query optimization. In such a model, the optimizer attempts to identify the most efficient join order, which minimizes the overall cost of the query plan. Successful query processing largely relies on the methodology implemented by the query optimizer. Many researches are concerned with the fact that query processing is considered an NP-hard problem especially when the query becomes bigger. Regarding large queries, it has been found that heuristic methods cannot cover all search spaces and may lead to falling in a local minimum. This paper examines how quantum-inspired ant colony algorithm, a hybrid strategy of probabilistic algorithms, can be devised to improve the cost of query joins in distributed databases. Quantum computing has the ability to diversify and expand, and thus covering large query search spaces. This enables the selection of the best trails, which speeds up convergence and helps avoid falling into a local optimum. With such a strategy, the algorithm aims to identify an optimal join order to reduce the total execution time. Experimental results show that the proposed quantum-inspired ant colony offers a faster convergence with better outcome when compared with the classic model.<\/jats:p>","DOI":"10.3390\/sym13010070","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T19:54:46Z","timestamp":1609703686000},"page":"70","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Dynamic Cost Ant Colony Algorithm to Optimize Query for Distributed Database Based on Quantum-Inspired Approach"],"prefix":"10.3390","volume":"13","author":[{"given":"Sayed A.","family":"Mohsin","sequence":"first","affiliation":[{"name":"Department of Information Technology, Institute of Graduate Studies and Research, Alexandria University, Alexandria 21526, Egypt"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ahmed","family":"Younes","sequence":"additional","affiliation":[{"name":"Department of Mathematics &amp; Computer Science, Faculty of Science, Alexandria University, Alexandria 21568, Egypt"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2723-1549","authenticated-orcid":false,"given":"Saad M.","family":"Darwish","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Institute of Graduate Studies and Research, Alexandria University, Alexandria 21526, Egypt"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"ref_1","unstructured":"Ramakrishnan, R. (2003). Databases Management Systems, McGraw-Hill Inc.. [3rd ed.]."},{"key":"ref_2","first-page":"23","article-title":"Query Optimization Strategies in Distributed Databases","volume":"3","author":"Tiwari","year":"2013","journal-title":"Int. J. Adv. Eng. Sci."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Dokeroglu, T., and Cosar, A. (2011, January 26\u201328). Dynamic Programming with Ant Colony Optimization Metaheuristic for Optimization of Distributed Database Queries. Proceedings of the 26th International Symposium on Computer and Information, London, UK.","DOI":"10.1007\/978-1-4471-2155-8_13"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s13748-018-0154-8","article-title":"A Review of Different Cost-based Distributed Query Optimizers","volume":"8","author":"Sharma","year":"2019","journal-title":"Prog. Artif. Intell."},{"key":"ref_5","first-page":"211","article-title":"Evolution of Query Optimization Methods","volume":"5740","author":"Hameurlain","year":"2009","journal-title":"Lect. Note Comput. Vis."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Chen, M., and Yu, P. (1990, January 2\u20134). Using Join Operations as Reducers in Distributed Query Processing. Proceedings of 2nd International Symposium on Databases in Parallel and Distributed System, Dublin, Ireland.","DOI":"10.1145\/319057.319074"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/32.6175","article-title":"Optimizing join queries in distributed databases","volume":"14","author":"Pramanik","year":"1988","journal-title":"IEEE Trans. Softw. Eng."},{"key":"ref_8","first-page":"1134","article-title":"Query Processing in Distributed Database through Data Distribution","volume":"2","author":"Raipurkar","year":"2013","journal-title":"Int. J. Adv. Res. Comput. Commun. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/352958.352982","article-title":"Iterative dynamic programming: A new class of query optimization algorithms","volume":"25","author":"Kossmann","year":"2000","journal-title":"ACM Trans. Database Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/93605.98740","article-title":"Randomized Algorithms for Optimizing Large Join Queries","volume":"19","author":"Ioannidis","year":"1990","journal-title":"ACM Sigmod Rec."},{"key":"ref_11","unstructured":"Horng, J.T., Cheng-Yan, K., and Baw-Jhiune, L. (1994, January 27\u201329). A Genetic Algorithm for Database Query Optimization. Proceedings of the First IEEE Conference on Evolutionary Computation, Orlando, FL, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1093\/comjnl\/bxp130","article-title":"An Evolutionary Genetic Algorithm for Optimization of Distributed Database Queries","volume":"54","author":"Sevinc","year":"2010","journal-title":"Comput. J."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1038\/s41534-017-0017-3","article-title":"Demonstration of quantum advantage in machine learning","volume":"3","author":"Ryan","year":"2017","journal-title":"NPJ Quantum Inf."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.comnet.2016.11.013","article-title":"Quantum-inspired algorithm for cyber-physical visual sur-veillance deployment systems","volume":"117","author":"Kuo","year":"2017","journal-title":"Comput. Netw."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Mohsin, S.A., Darwish, S.M., and Younes, A. (2020, January 8\u201310). Dynamic Cost Ant Colony Algorithm for Optimize Distributed Database Query. Proceedings of the Artificial Intelligence and Computer Vision (AICV2020), Cairo, Egypt.","DOI":"10.1007\/978-3-030-44289-7_17"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant Colony Optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Dorigo, M., and Stuzle, T. (2004). Ant Colony Optimization, MIT Press.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TEVC.2002.804320","article-title":"Quantum-inspired evolutionary algorithm for a class of combinatorial optimization","volume":"6","author":"Han","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Narayan, A., and Chellapilla, P. (2009, January 11\u201314). A novel quantum evolutionary algorithm for quadratic knap-sack problem. Proceedings of the 2009 IEEE International Conference on Systems, Man and Cybernetics, San Antonio, TX, USA.","DOI":"10.1109\/ICSMC.2009.5346276"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Kaye, P., Laflamme, R., and Mosca, M. (2007). An Introduction to Quantum Computing, Oxford University Press.","DOI":"10.1093\/oso\/9780198570004.001.0001"},{"key":"ref_21","first-page":"472","article-title":"Distributed Database Problems, Ap-proaches and Solutions\u2014A Study","volume":"8","author":"Rana","year":"2018","journal-title":"Int. J. Mach. Learn. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s007780050040","article-title":"Heuristic and Randomized Optimization for the Join-Ordering Problem","volume":"6","author":"Steinbrunn","year":"1997","journal-title":"Int. J. Very Large Data Bases"},{"key":"ref_23","first-page":"261","article-title":"Using Heuristics and Genetic Algorithms for Largescale Database Query Optimization","volume":"2","author":"Zhou","year":"2007","journal-title":"J. Inf. Comput. Sci."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Ban, W., Jiming, L., Jichao, T., and Shiwen, L. (2015, January 12\u201313). Query optimization of distributed database based on par-allel genetic algorithm and max-min ant system. Proceedings of the 8th International Symposium on Computational Intelligence and Design (ISCID), Hangzhou, China.","DOI":"10.1109\/ISCID.2015.199"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Li, N., Liu, Y., Dong, Y., and Gu, J. (2008, January 19\u201321). Application of Ant Colony Optimization Algorithm to Multi-Join Query Optimization. Proceedings of the 3rd International Symposium on Intelligence Computation and Applications, Berlin\/Heidelberg, Germany.","DOI":"10.1007\/978-3-540-92137-0_21"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10115-012-0608-4","article-title":"A multi-colony ant algorithm for optimizing join queries in distributed database systems","volume":"39","author":"Golshanara","year":"2014","journal-title":"Knowl. Inf. Syst."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10732-010-9136-0","article-title":"Quantum-inspired evolutionary algorithms: A survey and empirical study","volume":"17","author":"Zhang","year":"2011","journal-title":"J. Heuristics"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Chmiel, W., and Kwiecie\u0144, J. (2018). Quantum-Inspired Evolutionary Approach for the Quadratic Assignment Problem. Entropy, 20.","DOI":"10.3390\/e20100781"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"e12415","DOI":"10.1111\/exsy.12415","article-title":"Quantum-inspired genetic programming model with application to predict toxicity degree for chemical compounds","volume":"36","author":"Darwish","year":"2019","journal-title":"Expert Syst."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.asoc.2015.09.042","article-title":"New quantum inspired meta-heuristic techniques for multi-level colour image thresholding","volume":"46","author":"Dey","year":"2016","journal-title":"Appl. Soft Comput."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Tiwari, P., and Chande, S.V. (2018, January 17\u201318). Optimal Ant and Join Cardinality for Distributed Query Optimization Using Ant Colony Optimization Algorithm. Proceedings of the 2nd International Symposium on Emerging Trends in Expert Applications and Security, Singapore.","DOI":"10.1007\/978-981-13-2285-3_45"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.aop.2017.03.008","article-title":"Reading a single qubit system using weak measurement with variable strength","volume":"380","author":"Younes","year":"2017","journal-title":"Ann. Phys."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Duan, H. (2011). Ant colony optimization: Principle, convergence and application. Handbook of Swarm Intelligence, Springer.","DOI":"10.1007\/978-3-642-17390-5_16"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1134\/S1064230710010053","article-title":"Ant colony optimization algorithms for solving transportation problems","volume":"49","author":"Kazharov","year":"2010","journal-title":"J. Comput. Syst. Sci. Int."},{"key":"ref_35","first-page":"2","article-title":"Test Run\u2014Ant Colony Optimization","volume":"27","author":"James","year":"2012","journal-title":"Msdn Mag."},{"key":"ref_36","unstructured":"Deshpande, A., and Hellerstein, J.M. (March, January 26). Decoupled query optimization for federated database systems. Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, USA."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/1\/70\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:06:21Z","timestamp":1760159181000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/1\/70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,2]]},"references-count":36,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1]]}},"alternative-id":["sym13010070"],"URL":"https:\/\/doi.org\/10.3390\/sym13010070","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,2]]}}}