CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Query Optimization using Modified Ant Colony Algorithm

by Ajay Wagh, Varsha Nemade
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 167 - Number 2
Year of Publication: 2017
Authors: Ajay Wagh, Varsha Nemade
10.5120/ijca2017914185

Ajay Wagh, Varsha Nemade . Query Optimization using Modified Ant Colony Algorithm. International Journal of Computer Applications. 167, 2 ( Jun 2017), 29-33. DOI=10.5120/ijca2017914185

@article{ 10.5120/ijca2017914185,
author = { Ajay Wagh, Varsha Nemade },
title = { Query Optimization using Modified Ant Colony Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2017 },
volume = { 167 },
number = { 2 },
month = { Jun },
year = { 2017 },
issn = { 0975-8887 },
pages = { 29-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume167/number2/27745-2017914185/ },
doi = { 10.5120/ijca2017914185 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:13:46.574677+05:30
%A Ajay Wagh
%A Varsha Nemade
%T Query Optimization using Modified Ant Colony Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 167
%N 2
%P 29-33
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Query optimization is challenging task in database. Many different types of techniques used to optimize query. Heuristic Greedy, Iterative Improvement and Ant Colony algorithms is being used to query optimization. Ant colony Algorithm used to find optimal solution for different type of problems. In this paper we modify Ant Colony Algorithm for query optimization and will show the comparison execution time between Heuristic based optimization, Ant Colony Optimization and Modified Ant Colony optimization algorithms. After implementation of said existing algorithms and modified Ant Colony optimization algorithms we found that modified Ant colony taking less computation time as compare to others algorithms.

References
  1. Duy-Hung Phan et al.“A Novel, Low-latency Algorithm
for Multiple Group-By Query Optimization” ICDE 2016 Conference, IEEE , 978-1-5090-2020-1/16 2016 IEEE.
  2. Vishal P. Patel, Hardik R. Kadiya “Optimization of Large Join Query using Heuristic Greedy Algorithm ” IJCAT - International Journal of Computing and Technology Volume 1, Issue 1, February 2014
www.IJCAT.org
  3. Myungcheol Lee et al. “A JIT Compilation-based Unified SQL Query Optimization System” 978-1-5090-3765-0/16/ ©2016 IEEE
  4. 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 (IJLTET) ,Vol. 5 Issue 1 January 2015 , ISSN: 2278-621X
  5. Dr. G. R. Bamnote Professor & Head Dept. of CSE, PRMITR, Badnera, India ,Prof. S. S. Agrawal ,Asst. Prof Dept. of CSE, COE & T, Akola, India ,” Introduction to Query Processing and Optimization ”, International Journal of Advanced Research in Computer Science and Software Engineering , Volume 3, Issue 7, July 2013 ISSN: 2277 128X
  6. A. K. Giri and R. Kumar, “Distributed query processing plan generation using iterative improvement and simulated annealing,” 2013 IEEE 3rd International Advance Computing Conference, pp. 757-762, Feb. 2013.
  7. T. Kumar, V. Singh and A. K. Verma, “Distributed query processing plans generation using genetic algorithm,” International Journal of Computer Theory and Engineering, pp. 38-45, 2011.
  8. Melanie Mitchell, “An introduction to Genetic Algorithms”, Prentice Hall of India, 2004
  9. Hsiung Sam, Matthews James, “An introduction to Genetic Algorithms”, 2000 http://www.generation5.org/content/2000/ga.asp
  10. S. J. Xue, J. Zhang and X. D. Xu, “An improved algorithm based on ACO for cloud service PDTs scheduling”, Advances in Information Sciences and Service Sciences, vol. 4, no. 8, (2012), pp. 340-348.
  11. Y. C. Li, L. P. Liu, S. J. Zhou and Z. C. Yang, “Dynamic resource scheduling in construction project group management based on improved ACO algorithm”, Energy Education Science and Technology 
Part A: Energy Science and Research, vol. 31, no. 2, (2013), pp. 1111-1116.
  12. E. Walid, E. A. Haikal, A. Ajith and A. M. Alimi, “A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP. Applied Soft Computing Journal”, vol. 25, 
no. 12, (2014), pp. 234-241.
  13. J. H. Shen and J. Chen, “An improved ACO based RWA algorithm and its application in wavelength converter allocation issue of the intelligent optical networks”, Journal of Computational Information Systems, vol. 10, no. 8, (2014), pp. 3341-3349.
  14. J. B. Escario, J. F. Jimenez and J. M. Giron-Sierra, “Ant colony extended: Experiments on the travelling 
salesman problem”, Expert Systems with Applications, vol. 42, no. 1, (2015), pp. 390-410.
  15. F. Li and M. L. Jin, “GACO: a GPU-based high performance parallel multi-ant Colony Optimization 
algorithm”, Journal of Information and Computational Science, vol. 11, no. 6, (2014), pp. 1775-1784.
  16. Z. L. Zhang, C. Gao, Y. X. Liu and T. Qian, “A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model”, Bio inspiration and Bio mimetics, vol. 9, no. 3, (2014), pp. 1-7.
  17. M.Dorigoand L.M. Gambardella, “Ant colonies for the travelling salesman problem”, Biosystems, vol. 43, no. 2, (1997), pp. 73-81.
  18. M. Dorigo and G. D. Caro, “ant algorithms for discrete optimization”, Artificial Life, vol. 5, no. 3, (1999), pp. 137-172.
  19. T. Stutzle and H. H. Hoos, “MAX-MIN ant system”, Future Generation Computer Systems, vol. 16, no. 8, (2000), pp. 889-914.
  20. J. Dero and P. Siarry, “Continuous interacting ant colony algorithm based on dense hierarchy”, Future Generation Computer Systems, vol. 20, no. 5, (2004), pp. 841-856.
  21. M. Dorigo and L. M. Gambardella, “Ant colony system: a cooperative learning approach to the traveling salesman problem”, IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, (1997), pp. 53-66.
  22. L. M. Gambardella, E. Taillard and M. Dorigo, “Ant colonies for the quadratic assignment problem”, Journal of the Operational Research Society, vol. 50, no. 1, (1999), pp. 167-176.
  23. A. Colorni, M. Dorigo and V. Maniezzo, “Ant system for job-shop scheduling”, Belgian Journal of Operations Research, Statistics and Computer-Science, vol. 34, no. 1, (1994), pp. 39-54.
  24. S. Leng, X. B. Wei and W. Y. Zhang, “Improved ACO scheduling algorithm based on flexible process”, Transactions of Nanjing University of Aeronautics and Astronautics, vol. 23, no. 2, (2006), pp. 154-160.
  25. Y. Yi, Yang and J. L. Lai, “Computation model and improved ACO algorithm for p//T”, Journal of Systems Engineering and Electronics, vol. 20, no. 6, (2009), pp. 1336-1343.
  26. S. Mao and C. L. Zhao, “Unequal clustering algorithm for WSN based on fuzzy logic and improved ACO”, Journal of China Universities of Posts and Telecommunications, vol. 18, no. 6, (2011), pp. 89-97.
  27. A. Ugur and D. Aydin, “Improving performance of ACO algorithms using crossover mechanism based on best tours graph”, International Journal of Innovative Computing, Information and Control, vol. 8, no. 4, (2012), pp. 2789-2802.
  28. H. L. Xu, X. Qian and L. Zhang, “Study of ACO algorithm optimization based on improved tent chaotic mapping”, Journal of Information and Computational Science, vol. 9, no. 6, (2012), pp. 1653-1660.
  29. F. Li and M. L. Jin, “GACO: a GPU-based high performance parallel multi-ant Colony Optimization algorithm”, Journal of Information and Computational Science, vol. 11, no. 6, (2014), pp. 1775-1784.
  30. M. Dorigo and L. M. Gambardella, “Ant colonies for the travelling salesman problem”, Biosystems, vol. 43, no. 2, (1997), pp. 73-81.
  31. H. S. Paulora, T. Maria, A. Steiner and S. Scheer, “A new approach to solve the traveling salesman problem”, Neuro computing, vol. 70, no. 4, (2006), pp. 1013-1021.
  32. Ping Duan, Yong AI, Research on an Improved Ant Colony Optimization Algorithm and its Application” International Journal of Hybrid Information Technology Vol.9, No.4 (2016), pp. 223-234.
Index Terms

Computer Science
Information Sciences

Keywords

Query Optimization Heuristic-based optimizers Ant-Colony Modified Ant Colony.

Powered by PhDFocusTM