Query Optimization using Modified Ant Colony Algorithm

  title={Query Optimization using Modified Ant Colony Algorithm},
  author={Ajay Wagh and Varsha Nemade},
  journal={International Journal of Computer Applications},
  • Ajay Wagh, V. Nemade
  • Published 15 June 2017
  • Computer Science
  • International Journal of Computer Applications
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… Expand
Optimal Ant and Join Cardinality for Distributed Query Optimization Using Ant Colony Optimization Algorithm
This paper attempts to estimate minimum number of ants needed to optimize distributed queries with varied number of joins, coined as Ant Ratio, which evaluates the requirement of x number of ant for optimizing distributed query with y number of joining. Expand
Multi-join Query Optimization Using Modified ACO with GA
The hybridization of the authors' modified ACO with GA is proposed to overcome the above limitations for multi-join query optimization and experimentally shown the proposed method on randomly created dataset gives better results over GA and ACO in terms of distance and execution times. Expand
Evolutionary Algorithms for Query Op-timization in Distributed Database Sys-tems: A review
This paper provides working of bio-inspired computational algorithms in distributed database query optimization which includes genetic algorithms, ant colony algorithm, particle swarm optimization and Memetic Algorithms. Expand
Join Query Optimization Using Genetic Ant Colony Optimization Algorithm for Distributed Databases
  • P. Tiwari, Swati V. Chande
  • Computer Science
  • Emerging Technologies in Computer Engineering: Microservices in Big Data Analytics
  • 2019
This research paper focuses on the implementation of a hybrid strategy of Evolutionary Algorithms for the optimization of join queries in DDBMS using GACO-D (Genetic Ant Colony Optimization Algorithm for Distributed Database) and compares its performance with existing strategies. Expand
A review of different cost-based distributed query optimizers
It is ascertained that momentous volume of query optimization work has been effectuated using genetic algorithm followed by swarm particle optimization, and that the hybrid approach was and remains effective to unravel the query optimization problem. Expand
Clinical decision support system query optimizer using hybrid Firefly and controlled Genetic Algorithm
The amalgamated use of the proposed CDSS query optimizer framework will yield substantial variation in two consecutive generations which will efficaciously resolve the slow convergence problem of the controlled Genetic Algorithm. Expand
Accelerating supply chains with Ant Colony Optimization across a range of hardware solutions
This work demonstrates that the standard benchmarks are not suitable for generalised conclusions in the context of Ant Colony Optimization (ACO), and shows that in order to generalise the findings, the algorithms have to be tested on both standard benchmarks and real-world applications. Expand
Use of Nature-inspired Computing Techniques in Real World Applications (2010-2019) A Brief Review
The queries are becoming more complex and data intensive and the structure of distributed database and the obligation of an enterprise are the major reasons for the design of large and complex distributed queries. Expand


MAX-MIN Ant System
Computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that MM AS is currently among the best performing algorithms for these problems. Expand
Research on an Improved Ant Colony Optimization Algorithm and its Application
The proposed IMVPACO algorithm can obtain very good results in finding optimal solution and takes on better global search ability and convergence performance than other traditional methods. Expand
Ant Algorithms for Discrete Optimization
An overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and the ant colony optimization (ACO) metaheuristic is presented. Expand
GACO: A GPU-based High Performance Parallel Multi-ant Colony Optimization Algorithm ⋆
In GACO algorithm, some novel optimizations, such as hybrid pheromone matrix update, dynamic nearest neighbor path construction, and multiple ant colony distribution are utilized, which result in a higher speedup and a better quality solutions compared to other peer of algorithms. Expand
Distributed query processing plan generation using iterative improvement and simulated annealing
An approach is presented that is able to generate optimal query processing plans for a given user query that uses iterative improvement and simulated annealing algorithms to determine optimal query plans forA given query. Expand
A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP
A novel approach is presented by introducing a PSO, which is modified by the ACO algorithm to improve the performance, and the new hybrid method (PSO-ACO) is validated using the TSP benchmarks. Expand
A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model.
Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Expand
Ant colony system: a cooperative learning approach to the traveling salesman problem
The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs. Expand
Ant Colony Extended: Experiments on the Travelling Salesman Problem
The algorithm is able to solve the Travelling Salesman Problem successfully compared with other classical ant algorithms and shows better performance than ACS and MMAS in almost every TSP tested instance. Expand
Ant colonies for the quadratic assignment problem
Experimental results show that HAS-QAP and the hybrid genetic algorithm perform best on real world, irregular and structured problems due to their ability to find the structure of good solutions, while HAS–QAP performance is less competitive on random, regular and unstructured problems. Expand