Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 628471, 17 pages
http://dx.doi.org/10.1155/2014/628471
Research Article

Distributed Query Plan Generation Using Multiobjective Genetic Algorithm

1SFIO-NIC Division, National Informatics Center, Ministry of Information Technology, New Delhi 110003, India
2School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi 110067, India

Received 23 August 2013; Accepted 23 January 2014; Published 14 May 2014

Academic Editors: L. D. S. Coelho, Y. Jiang, W. Su, and G. A. Trunfio

Copyright © 2014 Shina Panicker and T. V. Vijay Kumar. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Ceri and G. Pelgatti, Distributed Databases: Principles & Systems, International Edition, McGraw-Hill Computer Science Series, 1985.
  2. A. R. Hevner and S. B. Yao, “Query processing in distributed database systems,” IEEE Transactions on Software Engineering, vol. 5, no. 3, pp. 177–187, 1979. View at Google Scholar · View at Scopus
  3. T. V. Vijay Kumar and S. Panicker, “Generating query plans for distributed query processing using genetic algorithm,” in Information Computing and Applications, vol. 7030 of Lecture Notes in Computer Science, pp. 765–772, 2011. View at Publisher · View at Google Scholar
  4. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 2, pp. 182–197, 2002. View at Publisher · View at Google Scholar · View at Scopus
  5. P. Black and W. Luk, “A new heuristic for generating semi-join programs for distributed query processing,” in Proceedings of the IEEE 6th International Computer Software and Application Conference, pp. 581–588, IEEE, Chicago, Ill, USA, November 1982.
  6. P. Bodorik and J. S. Riordon, “A threshold mechanism for distributed query processing,” in Proceedings of the 16th Annual Conference on Computer Science, pp. 616–625, Atlanta, Ga, United States, February 1988. View at Publisher · View at Google Scholar
  7. J. Chang, “A heuristic approach to distributed query processing,” in Proceedings of the 8th International Conference on Very Large Data Bases (VLDB '82), pp. 54–61, Saratoga, Calif, USA, 1982.
  8. D. Kossmann, “The state of the art in distributed query processing,” ACM Computing Surveys, vol. 32, no. 4, pp. 422–469, 2000. View at Google Scholar · View at Scopus
  9. L. Stiphane and W. Eugene, “A state transition model for distributed query processing,” ACM Transactions on Database Systems, vol. 11, no. 3, pp. 249–322, 1986. View at Publisher · View at Google Scholar
  10. T. V. Vijay Kumar, V. Singh, and A. K. Verma, “Distributed query processing plans generation using genetic algorithm,” International Journal of Computer Theory and Engineering, vol. 3, no. 1, pp. 38–45, 2011. View at Google Scholar
  11. C. T. Yu and C. C. Chang, “Distributed query processing,” ACM Computing Surveys, vol. 16, no. 4, pp. 399–433, 1984. View at Publisher · View at Google Scholar
  12. K. Bennett, M. C. Ferris, and Y. E. Ioannidis, “A Genetic algorithm for database query optimization,” in Proceedings of the 4th International Conference on Genetic Algorithms, pp. 400–407, 1991.
  13. Y. E. Ioannidis and Y. Cha Kang, “Randomized algorithms for optimizing large join queries,” in Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, pp. 312–321, May 1990. View at Scopus
  14. Y. Ioannidis and E. Wong, “Query optimization by simulated annealing,” in Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD '87), pp. 9–22, 1987. View at Publisher · View at Google Scholar
  15. A. A. R. Townsend, Genetic Algorithms: A Tutorial, 2003.
  16. M. Gregory, Genetic Algorithm Optimization of Distributed Database Queries, IEEE, 1998.
  17. M. Mitchell, An Introduction to Genetic Algorithms, The MIT Press, Cambridge, Mass, USA, 1999.
  18. J. D. Schaffer, “Multiple objective optimization with vector evaluated genetic algorithms,” in Proceedings of the International Conference on Genetic Algorithm and Their Applications, pp. 93–100, July 1985.
  19. V. Guliashki, H. Toshev, and C. Korsemov, “Survey of evolutionary algorithms used in multiobjective optimization,” Problems of Engineering Cybernetics and Robotics, vol. 60, pp. 42–54, 2009. View at Google Scholar
  20. C. M. Fonseca and P. J. Fleming, “Genetic algorithms for multiobjective optimization: formulation, discussion and generalization,” in Proceedings of the 5th International Conference on Genetic Algorithms, S. Forrest, Ed., pp. 416–423, San Francisco, Calif, USA, 1993.
  21. J. Horn, N. Nafpliotis, and D. E. Goldberg, “A niched Pareto genetic algorithm for multiobjective optimization,” in Proceedings of the 1st IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, pp. 82–87, IEEE, Orlando, Fla, USA, June 1994. View at Scopus
  22. N. Srinivas and K. Deb, “Multiobjective optimization using nondominated sorting in genetic algorithms,” Evolutionary Computation, vol. 2, no. 3, pp. 221–248, 1994. View at Publisher · View at Google Scholar
  23. E. Zitzler and L. Thiele, “Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 4, pp. 257–271, 1999. View at Publisher · View at Google Scholar · View at Scopus
  24. J. D. Knowles and D. W. Corne, “Approximating the nondominated front using the Pareto archived evolution strategy,” Evolutionary computation, vol. 8, no. 2, pp. 149–172, 2000. View at Google Scholar · View at Scopus
  25. D. W. Corne, J. D. Knowles, and M. J. Oates, “The Pareto envelope-based selection algorithm for multiobjective optimization,” in Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, Springer, Paris, France, September 2000.
  26. J. Scharnow, K. Tinnefeld, and I. Wegener, “The analysis of evolutionary algorithms on sorting and shortest paths problems,” Journal of Mathematical Modelling and Algorithms, vol. 3, no. 4, pp. 349–366, 2004. View at Google Scholar · View at Scopus
  27. B. Doerr, E. Happ, and C. Klein, “Crossover can provably be useful in evolutionary computation,” in Proceedings of the 10th Annual Genetic and Evolutionary Computation Conference (GECCO '08), pp. 539–546, ACM Press, July 2008. View at Scopus
  28. C. Horoba, “Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem,” in Proceedings of the 10th ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA '09), pp. 113–120, ACM Press, New York, NY, USA, January 2009. View at Publisher · View at Google Scholar · View at Scopus
  29. M. Theile, “Exact solutions to the traveling salesperson problem by a population-based evolutionary algorithm,” in Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP '09), vol. 5482 of Lecture Notes in Computer Science, pp. 145–155, Springer, April 2009. View at Publisher · View at Google Scholar
  30. A. V. Eremeev, On Linking Dynamic Programming and Multi-Objective Evolutionary Algorithms, Omsk State University, 2008.
  31. A. V. Eremeev, “A fully polynomial randomized approximation scheme based on an evolutionary algorithm,” Diskretnyi Analiz i Issledovanie Operatsii, vol. 17, no. 4, pp. 3–17, 2010. View at Google Scholar
  32. T. Friedrich, N. Hebbinghaus, F. Neumann, J. He, and C. Witt, “Approximating covering problems by randomized search heuristics using multi-objective models,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 797–804, ACM Press, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  33. E. Elbeltagi, T. Hegazy, and D. Grierson, “A modified shuffled frog-leaping optimization algorithm: applications to project management,” Structure and Infrastructure Engineering, vol. 3, no. 1, pp. 53–60, 2007. View at Publisher · View at Google Scholar · View at Scopus
  34. M. Dorigo, E. Bonabeau, and G. Theraulaz, “Ant algorithms and stigmergy,” Future Generation Computer Systems, vol. 16, no. 8, pp. 851–871, 2000. View at Publisher · View at Google Scholar · View at Scopus
  35. D. E. Goldberg and K. Deb, “A comparative analysis of selection schemes used in genetic algorithms,” in Foundations of Genetic Algorithms, pp. 69–93, Morgan Kaufmann, San Mateo, Calif, USA, 1991. View at Google Scholar
  36. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
  37. H. Dong and Y. Liang, “Genetic algorithms for large join query optimization,” in Proceedings of the 9th Annual Genetic and Evolutionary Computation Conference (GECCO '07), pp. 1211–1218, London, UK, July 2007. View at Publisher · View at Google Scholar · View at Scopus
  38. I. F. Sbalzariniy, M. Sibylle, and P. Koumoutsakosyz, “Multiobjective optimization using evolutionary algorithms,” Center for Turbulence Research Proceedings of the Summer Program 2000.
  39. E. Zitzler and L. Thiele, “Multiobjective optimization using evolutionary algorithms—a comparative case study,” in Parallel Problem Solving from Nature, pp. 292–301, Springer, Amsterdam, The Netherlands, 1998. View at Google Scholar
  40. C. A. C. Coello, “An updated survey of GA-based multiobjective optimization techniques,” ACM Computing Surveys, vol. 32, no. 2, pp. 137–143, 2000. View at Google Scholar · View at Scopus
  41. D. A. Van Veldhuizen and G. B. Lamont, “Multiobjective evolutionary algorithms: analyzing the state-of-the-art,” Evolutionary computation, vol. 8, no. 2, pp. 125–147, 2000. View at Google Scholar · View at Scopus
  42. F. Glover and S. Hanafi, “Tabu search and finite convergence,” Discrete Applied Mathematics, vol. 119, no. 1-2, pp. 3–36, 2002. View at Publisher · View at Google Scholar · View at Scopus
  43. A. C. Nearchou, “The effect of various operators on the genetic search for large scheduling problems,” International Journal of Production Economics, vol. 88, no. 2, pp. 191–203, 2004. View at Publisher · View at Google Scholar · View at Scopus
  44. W. W. Chu and P. Hurley, “Optimal query processing for distributed database systems,” IEEE Transactions on Computers, vol. 31, no. 9, pp. 835–850, 1982. View at Google Scholar · View at Scopus
  45. M. Serpell and J. E. Smith, “Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms,” Evolutionary Computation, vol. 18, no. 3, pp. 491–514, 2010. View at Publisher · View at Google Scholar
  46. A. Seshadri, A Fast Elitist Multiobjective Genetic Algorithm: NSGA-II, MATLAB Central, 2006.