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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Enhanced Ant Colony-based Approach for Query Optimization

by Hany A. Hanafy, Ahmed M. Gadallah, Hesham A. Hefny
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 175 - Number 4
Year of Publication: 2017
Authors: Hany A. Hanafy, Ahmed M. Gadallah, Hesham A. Hefny
10.5120/ijca2017915519

Hany A. Hanafy, Ahmed M. Gadallah, Hesham A. Hefny . An Enhanced Ant Colony-based Approach for Query Optimization. International Journal of Computer Applications. 175, 4 ( Oct 2017), 37-42. DOI=10.5120/ijca2017915519

@article{ 10.5120/ijca2017915519,
author = { Hany A. Hanafy, Ahmed M. Gadallah, Hesham A. Hefny },
title = { An Enhanced Ant Colony-based Approach for Query Optimization },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2017 },
volume = { 175 },
number = { 4 },
month = { Oct },
year = { 2017 },
issn = { 0975-8887 },
pages = { 37-42 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume175/number4/28479-2017915519/ },
doi = { 10.5120/ijca2017915519 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:24:12.038091+05:30
%A Hany A. Hanafy
%A Ahmed M. Gadallah
%A Hesham A. Hefny
%T An Enhanced Ant Colony-based Approach for Query Optimization
%J International Journal of Computer Applications
%@ 0975-8887
%V 175
%N 4
%P 37-42
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

One of the mandatory processes for all those types of applications is the inquiry process of the stored huge amounts of data. Such process is either a predefined or an ad-hoc query. From the logical point of view, the query process depends mainly on many algebraic operations, including selection, projection and joining operations. The most important one of them is the join operation, which represents the key factor of the inquiry process to retrieve the related information from different data tables. Many approaches have been proposed aiming to reduce the cost of join operations. Yet, there is still a need for more query optimizing processes in order to reduce the query response time. This paper proposes an enhanced optimal query processing approach for inner and outer join, where the proposed model exploits an adopted Ant Colony Optimization.

References
  1. Chaudhuri, S.: An Overview of Query Optimization in Relational Systems, ACM, pp. 34-43 (1998).
  2. Doka,K., Tsoumakos,D. ,Koziris,N.: Online querying of d-dimensional hierarchies. J. Parallel Distrib. Comput. 71, 424–437 (2011).
  3. Dong ,H. and Liang,Y.: Genetic Algorithms for Large Join Query Optimization, ACM,pp.1211-1218(2007).
  4. Elmasri ,R.andNavathe,S.B: Fundamentals of database systems, third edition, Addison Wesley(2000).
  5. Galindo-Legaria, C. and Rosenthal, A .: Query Graphs, Implementing Trees, and Freely Reorderable Outer joins, In Proc. of ACM SIGMOD, Atlantic City,pp.291-299(1990).
  6. Hany A. Hanafy and Ahmed M. Gadallah.:Ant Colony-Based Approach for Query Optimization, DMBD 2016, LNCS 9714, pp. 425–433, (2016).
  7. Haritsa,J.: Query Optimizer Plan Diagrams: Production, Reduction and Applications, Database Systems Lab, Indian Institute of Science, ICDE Conference, 1374-1377(2011).
  8. Hlaing,Z. and Khine,A.: Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization Algorithm, International Journal of Information and Education Technology, Vol. 1, No. 5,404-409, December (2011).
  9. Jarke, M. and Koch, J.: Query Optimization in Database Systems. ACM,Computing Surveys, Vol. 16, No. 2,pp.111- 152, June (1984).
  10. Jin,L. and Li,C.: Selectivity Estimation for Fuzzy String Predicates in Large Data Sets, Proceedings of the 31st VLD Conference,Trondheim, Norway, pp.397-408(2005).
  11. Kabra,N.,DeWitt,D.J.: Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans, ACM SIGMOD ,98 Seattle, WA, USA , PP.106-117(1998).
  12. Kabra,N.,DeWitt,D.J.: Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans, ACM SIGMOD ,98 Seattle, WA, USA , PP.106-117 (1998).
  13. Krynicki,K. and Jean,J.: AntElements: An Extensible and Scalable Ant Colony Optimization Middleware, GECCO ’15,1109-1116, July 11 - 15, Madrid, Spain (2015).
  14. Li,Z.,Ross,K.A.: Fast joins using join indices, The VLDB Journal,Vol 8, PP.1-24 (1999).
  15. Mahajan,S. and Jadhav,V.: An Analysis of Execution Plans in Query Optimization, International Conference on Communication, Information & Computing Technology (ICCICT), Oct. 19-20, Mumbai, India, 1-5 (2012).
  16. Mahmoud,F.,Shaban,S.,Abd El-Naby,H.: A proposed Query Optimizer Based on Genetic Algorithms,The Egyptian Computer Journal,Vol.37,No.1(2010).
  17. Mavrovouniotis,M., Müller,F,Yang,S.: An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem, GECCO ’15, 49-56, July 11 - 16, Madrid, Spain (2015)
  18. Mishra P, Eich, MH.: Join processing in relational databases. ACM Computing Surveys Vol. 24, pp.63–113 (1992).
  19. Rahman,S. , Ahsan Feroz,A.M. , Kamruzzaman,M. , Faruque,M.: Analyze Database Optimization Techniques, IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.8, August (2010).
  20. Steinbrunn ,M., Moerkotte,G., Kemper,A.: Heuristic and randomized optimization for the join ordering problem, The VLDB Journal Vol.6, PP.191–208 (1997).
  21. Youssefi, K., Wong, E.: Query processing in a relational database management system, In ProcConf VLDB, Rio de Janeiro, Brazil, PP.409-417 (1979).
  22. Yu,P.S.,Cornell,D.W.: Buffer Management Based on Return on Consumption In a Multi-Query Environment, VLDB Journal,Vol2, PP.1-37(1993).
  23. Yu,X.,Chen,W.,Zhang,J.: A Set-based Comprehensive Learning Particle Swarm Optimization with Decomposition for Multiobjective Traveling Salesman Problem, GECCO '15, 89-96, July 11 – 15, Madrid, Spain (2015).
  24. Selinger,P.G., Astrahan,M.M., Chamberlin,D.D., Lorie,R.A., Price,T.G.: Access Path Selection in a Relational Database Management System, ACM.Inc.(1979).
  25. Favaretto, D., Moretti,E., Pellegrini,P.: An Ant Colony System Approach for Variants of the Traveling Salesman Problem with Time Windows, Journal of Information & Optimization Sciences Vol.27, No.1, PP.35-54(2006).
  26. Ioannidis,Y.E., Kang,Y.C.: Randomized Algorithms for Optimizing Large Join Queries, ACM(1990).
  27. Swami,A.: Optimization of Large Join Queries: Combining Heuristics and Combinatorial Techniques, ACM, SIGMOD Conference,PP. 367-376 (1989).
  28. Ioannidis,Y.E., Wong,E.: Query Optimization by Simulated Annealing, ACM, SIGMOD Conference, PP.9-22(1987).
  29. Lanzelotte,R., Valduries, P., Zait,M.: On the Effectiveness of Optimization Search Strategies for Parallel Execution Spaces. In proceedings of the Conference on Very Large Databases, PP.493-504(1993).
  30. Galindo-Legaria,C., Pellenkoft,A., Kersten,M.: Fast, Randomized Join-Order Selection Why Use Transformations?. In proceedings of the 20th International Conference on Very Large Databases, PP.85-95(1994).
  31. Choi,I-C., Kim,S-I., Kim,H-S.: A Genetic Algorithm with a Mixed Region Search for the Asymmetric Traveling Salesman Problem, Computers & Operations Research 30, PP.773-786(2003).
  32. Bennett,K., Ferris,M.,C., Ioannidis,Y.,E.: A Genetic Algorithm for Database Query Optimization, Copmuter Science Technical Report #1004(1991).
Index Terms

Computer Science
Information Sciences

Keywords

Query Optimization Ant Colony Logical Optimizer Query Access Plan outer join.

Powered by PhDFocusTM