{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T16:14:41Z","timestamp":1654100081451},"reference-count":46,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7,1]]},"abstract":"
A large number of queries are posed on databases spread across the globe. In order to process these queries efficiently, optimal query processing strategies that generate efficient query processing plans are being devised. In distributed relational database systems, due to replication of relations at multiple sites, the relations required to answer a query may necessitate accessing of data from multiple sites. This leads to an exponential increase in the number of possible alternative query plans for processing a query. Though it is not computationally feasible to explore all possible query plans in such a large search space, the query plan that provides the most cost-effective option for query processing is considered necessary and should be generated for a given query. In this paper, an attempt has been made to generate such optimal query plans using Set based Comprehensive Learning Particle Swarm Optimization (S-CLPSO). Experimental comparisons of this algorithm with the GA based distributed query plan generation algorithm shows that for higher number of relations, the S-CLPSO based algorithm is able to generate comparatively better quality Top-K query plans.<\/p>","DOI":"10.4018\/ijsir.2013070104","type":"journal-article","created":{"date-parts":[[2014,1,20]],"date-time":"2014-01-20T17:44:11Z","timestamp":1390239851000},"page":"58-82","source":"Crossref","is-referenced-by-count":7,"title":["Distributed Query Plan Generation using Particle Swarm Optimization"],"prefix":"10.4018","volume":"4","author":[{"given":"T.V. Vijay","family":"Kumar","sequence":"first","affiliation":[{"name":"School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India"}]},{"ORCID":"http:\/\/orcid.org\/0000-0002-8594-4515","authenticated-orcid":true,"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[{"name":"School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India"}]},{"given":"Rahul","family":"Singh","sequence":"additional","affiliation":[{"name":"School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India"}]}],"member":"2432","reference":[{"key":"ijsir.2013070104-0","doi-asserted-by":"crossref","unstructured":"Afshinmanesh, F., Marandi, A., & Rahimi-Kian, A. (2005). A novel binary particle swarm optimization method using artificial immune system. In Proc. IEEE Int. Conf. Comput. Tool (EUROCON).","DOI":"10.1109\/EURCON.2005.1629899"},{"key":"ijsir.2013070104-1","unstructured":"Alom, B. M., Henskens, F., & Hannaford, M. (2009). Query processing and optimization in distributed database systems. IJCSNS International Journal of Computer Science and Network Security, 9(9)."},{"issue":"1","key":"ijsir.2013070104-2","first-page":"180","article-title":"Analysis of particle swarm optimization algorithm.","volume":"3","author":"Q.Bai","year":"2010","journal-title":"Computer and Information Science"},{"key":"ijsir.2013070104-3","unstructured":"Bennett, K., Ferris, M. C., & Ioannidis, Y. (1991). A genetic algorithm for database query optimization. In Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 400-407)."},{"key":"ijsir.2013070104-4","unstructured":"Bodorik, P., & Riordon, J. S. (1988, February 2-4). Distributed query processing optimization objectives. In Proc. of the IEEE Fourth Int. Data Engineering Conference, Los Angeles, CA (pp. 320-329)."},{"key":"ijsir.2013070104-5","author":"S.Ceri","year":"1984","journal-title":"Distributed database: Principles and systems"},{"key":"ijsir.2013070104-6","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2030331"},{"key":"ijsir.2013070104-7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39930-8_8"},{"key":"ijsir.2013070104-8","doi-asserted-by":"publisher","DOI":"10.1109\/4235.985692"},{"key":"ijsir.2013070104-9","doi-asserted-by":"crossref","unstructured":"Dong, H., & Liang, Y. (2007). Genetic algorithms for large join query optimization. In the Proceedings of the Ninth Annual Conference on Genetic and Evolutionary Computation (GECCO), London, UK (pp. 1211-1218).","DOI":"10.1145\/1276958.1277193"},{"key":"ijsir.2013070104-10","doi-asserted-by":"crossref","unstructured":"Eberhart, R. C., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In proceedings of the 6th International Symposium on Micro Machine and Human Science, Nagoya, Japan (pp. 39-43).","DOI":"10.1109\/MHS.1995.494215"},{"key":"ijsir.2013070104-11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0040812"},{"key":"ijsir.2013070104-12","unstructured":"Gregory, M. (1998). Genetic algorithm optimization of distributed database queries. In Evolutionary Computation Proceedings, IEEE World Congress on Computational Intelligence (pp. 271-276)."},{"key":"ijsir.2013070104-13","doi-asserted-by":"crossref","unstructured":"Hassan, R., Cohanim, B., De Weck, O., & Venter, O. (2005). A comparison of particle swarm optimization and the genetic algorithm. In Proceedings of the 46th AIAA\/ASME\/ASCE\/AHS\/ASC Structures, Structural Dynamics, and Materials Conference (pp. 1-13). Key: citeulike:5781649.","DOI":"10.2514\/6.2005-1897"},{"key":"ijsir.2013070104-14","unstructured":"Hu, X., & Eberhart, R. C. (2002). Multiobjective optimization using dynamic neighborhood particle swarm optimization. In Proceedings of the 2002 IEEE Congress on Evolutionary Computation, Honolulu, HI (pp. 1677-1681)."},{"key":"ijsir.2013070104-15","doi-asserted-by":"publisher","DOI":"10.1145\/93605.98740"},{"key":"ijsir.2013070104-16","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y. E., & Kang, Y. C. (1991). Left-deep vs. bushy trees: An analysis of strategy spaces and its implementations on query optimization. In SIGMOD International Conference on Management of Data, Denver, CO (pp. 168-177).","DOI":"10.1145\/119995.115813"},{"key":"ijsir.2013070104-17","doi-asserted-by":"crossref","unstructured":"Ioannidis, Y. E., & Wong, E. (1987). Query optimization by simulated annealing. In Proceedings ofthe 1987 ACM-SIGMOD Conference, San Franscisco, CA (pp. 9-22).","DOI":"10.1145\/38714.38722"},{"key":"ijsir.2013070104-18","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356928"},{"key":"ijsir.2013070104-19","doi-asserted-by":"publisher","DOI":"10.7232\/iems.2012.11.3.215"},{"key":"ijsir.2013070104-20","doi-asserted-by":"crossref","unstructured":"Kennedy, J. (1999). Small worlds and mega minds: Effects of neighborhood topology on particle swarm performance. In Proceedings of 1999 IEEE Congress on Evolutionary Computation, Washington, DC (pp. 1931-1938).","DOI":"10.1109\/CEC.1999.785509"},{"key":"ijsir.2013070104-21","unstructured":"Kennedy, J., & Eberhart, R. C. (1997). A discrete binary version of the particle swarm optimization. In Proceedings of the Conference on System, Man, and Cybernetics. IEEE Service Center."},{"key":"ijsir.2013070104-22","doi-asserted-by":"crossref","unstructured":"Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2004). Particle swarm optimization algorithms with novel learning strategies. In Proc. Int. Conf. Systems, Man, Cybernetics.","DOI":"10.1109\/ICSMC.2004.1400911"},{"key":"ijsir.2013070104-23","doi-asserted-by":"crossref","unstructured":"Liang, J. J., & Suganthan, P. N. (2006b). Adaptive comprehensive learning particle swarm optimizer with history learning. In Proceedings of the 6th International Conference on Simulated Evolution and Learning (vol. 4247, pp. 213-220).","DOI":"10.1007\/11903697_28"},{"key":"ijsir.2013070104-24","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.857610"},{"key":"ijsir.2013070104-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.11.017"},{"key":"ijsir.2013070104-26","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ijsir.2013070104-27","unstructured":"Liu, C., Chen, H., & Krueger, W. (1996). A distributed query processing strategy using placement dependency. In Proceedings of the International Conference on Data Engineering."},{"key":"ijsir.2013070104-28","doi-asserted-by":"publisher","DOI":"10.1109\/71.238624"},{"key":"ijsir.2013070104-29","doi-asserted-by":"crossref","unstructured":"Mendes, R., Kennedy, J., & Neves, J. (2003). Watch thy neighbor or how the swarm can learn from its environment. In Proceedings of the 2003 IEEE Swarm Intelligence Symposium, Indianapolis, IN (pp. 88-94).","DOI":"10.1109\/SIS.2003.1202252"},{"key":"ijsir.2013070104-30","author":"M. T.Ozsu","year":"1991","journal-title":"Principles of distributed database systems"},{"key":"ijsir.2013070104-31","unstructured":"Pang, W., Wang, K. P., Zhou, C. G., & Dong, L. J. (2004b). Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In Proc. 4th Int. Conf. Comput. Information Technol. (CIT)."},{"key":"ijsir.2013070104-32","unstructured":"Pang, W., Wang, K. P., Zhou, C. G., Dong, L. J., Liu, M., Zhang, H. Y., & Wang, J. Y. (2004a). Modified particle swarm optimization based on space and transformation for solving traveling salesman problem. In Proc. 3rd Int.Conf. Mach. Learning Cybern."},{"key":"ijsir.2013070104-33","doi-asserted-by":"crossref","unstructured":"Rezazadeh, I., Meybodi, M. R., & Naebi, A. (2011). Adaptive particle swarm optimization algorithm for dynamic environments. In Proceeding ICSI'11 Proceedings of the Second International Conference on Advances in Swarm Intelligence (Volume Part I, pp. 120-129). Springer-Verlag Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-21515-5_15"},{"key":"ijsir.2013070104-34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018967414664"},{"key":"ijsir.2013070104-35","doi-asserted-by":"publisher","DOI":"10.1016\/S0141-9331(02)00053-4"},{"key":"ijsir.2013070104-36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2006.09.002"},{"key":"ijsir.2013070104-37","unstructured":"Shi, Y., & Eberhart, R. C. (1998a). A modified particle swarm optimizer. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, Anchorage, AK (pp. 69-73)."},{"key":"ijsir.2013070104-38","doi-asserted-by":"crossref","unstructured":"Shi, Y., & Eberhart, R. C. (1998b). Parameter selection in particle swarm optimization. In Proceedings of the Seventh Annual Conference on Evolutionary Programming (pp. 591-600).","DOI":"10.1007\/BFb0040810"},{"key":"ijsir.2013070104-39","unstructured":"Stillger, M., & Spiliopoulou, M. (1996). Genetic programming in database query optimization. In Proceedings of the First Annual Conference on Genetic Programming, Stanford, CA (pp. 388-393)."},{"key":"ijsir.2013070104-40","doi-asserted-by":"crossref","unstructured":"Swami, A., & Gupta, A. (1998). Optimization of large join queries. In Proceedings of 1988 ACM-SIGMOD Conference, Chicago, IL (pp. 8-17).","DOI":"10.1145\/971701.50203"},{"key":"ijsir.2013070104-41","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.896686"},{"key":"ijsir.2013070104-42","doi-asserted-by":"publisher","DOI":"10.7763\/IJCTE.2011.V3.280"},{"key":"ijsir.2013070104-43","unstructured":"Wang, K. P., Huang, L., Zhou, C. G., & Pang, W. (2003). Particle swarm optimization for traveling salesman problem. In Proc. 2nd Int. Conf. Mach. Learning Cybern."},{"key":"ijsir.2013070104-44","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2006.10.001"},{"key":"ijsir.2013070104-45","doi-asserted-by":"crossref","unstructured":"Zhao, S. Z., Suganthan, P. N., & Das, S. (2010). Dynamic multi-swarm particle swarm optimizer with sub-regional harmony search. In Proceedings of the WCCI 2010 IEEE World Congress on Computational Intelligence.","DOI":"10.1109\/CEC.2010.5586323"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=99655","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:38:09Z","timestamp":1654097889000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijsir.2013070104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,7,1]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"URL":"http:\/\/dx.doi.org\/10.4018\/ijsir.2013070104","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":["Artificial Intelligence","Computational Theory and Mathematics","Computer Science Applications"],"published":{"date-parts":[[2013,7,1]]}}}