MIWAI 2013: Multi-disciplinary Trends in Artificial Intelligence pp 293-304 | Cite as
Distributed Query Plan Generation Using HBMO
Abstract
Processing a distributed query entails accessing data from multiple sites. The inter site communication cost, being the dominant cost, needs to be reduced in order to improve the query response time. This would require the query optimizer to devise a distributed query processing strategy that would, for a given distributed query, generate query plans involving fewer number of sites in order to reduce the inter site communication cost. In this paper, a distributed query plan generation algorithm, based on the honey bee mating optimization (HBMO) technique that generates query plans for a distributed query involving less number of sites and higher relation concentration in the participating sites, is presented. Further, experimental comparison of the proposed HBMO based DQPG algorithm with the GA based DQPG algorithm shows that the former is able to generate distributed query plans at a comparatively lesser total query processing cost, which in turn would lead to efficient processing of a distributed query.
Keywords
Distributed Query Processing Swarm Intelligence Honey Bee Mating OptimizationPreview
Unable to display preview. Download preview PDF.
References
- 1.Abbass, H.A.: MBO: Marriage in Honey Bees Optimization a Haplometrosis Polygynous Swarming Approach. In: Proceedings of the 2001 Congress on Evolutionary Computation, pp. 207–214 (2001)Google Scholar
- 2.Apers, P.M.G., Hevner, A.R., Yao, S.B.: Optimization algorithms for distributed queries. IEEE Transactions on Software Engineering, SE-9, 57–68 (1983)Google Scholar
- 3.Batouche, M., Bitam, S.: A survey on bee colony algorithms. In: 2010 IEEE International Symposium on Parallel and Distributed Processing, pp. 1–8 (2010)Google Scholar
- 4.Blum, C., Merkle, D.: Swarm intelligence introduction and applications. Natural Computing Series. Springer (1998)Google Scholar
- 5.Cornell, D.W., Yu, P.S.: An optimal site assignment for relations in the distributed database environment. IEEE Transactions on Software Engineering 15, 1004–1009 (1989)CrossRefGoogle Scholar
- 6.Davidović, T., Šelmić, M., Teodorović, D., Ramljak, D.: Bee colony optimization for scheduling independent tasks to identical processors. Journal of Heuristics 18(4), 549–569 (2012)CrossRefGoogle Scholar
- 7.Epstein, R., Stonebraker, M., Wong, E.: Query processing in a distributed relational database system. In: Proc. ACM-SIGMOD Int. Conf. on Management of Data, pp. 169–180 (1978)Google Scholar
- 8.Fathian, M., Amiri, B., Maroosi, A., Application of Honey Bee Mating Optimization Algorithm on Clustering. Applied Mathematics and Computation (2007); Elsevier Inc. International Symposium on Parallel and Distributed Processing, pp. 1–8 Google Scholar
- 9.Haddad, B.O., Afshar, A., Mariano, M.A., Adams, B.J.: Honey Bee Mating Optimization (HBMO) Algorithm: A New Heuristic Approach for Water Resources Optimization. Water Resources Management, 661–680 (2006)Google Scholar
- 10.Henderson, D., Jacobson, S.H., Johnson, A.W.: The Theory and Practice of simulated annealing, State-of-the-Art Handbook in Metaheuristic, pp. 287–319. Kluwer Academic Publishing, Norwell (2003)Google Scholar
- 11.Ioannidis, Y.E., Kang, Y.C.: Randomized Algorithms for Optimizing Large Join Queries. In: Proc. ACM-SIGMOD Intl. Conf. on Management of Data, Atlantic City, NJ, pp. 312–321 (1990)Google Scholar
- 12.Ioannidis, Y.E., Kang, Y.C.: 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, pp. 168–177 (1991)Google Scholar
- 13.Ioannidis, Y.E., Wong, E.: Query Optimization by Simulated Annealing. In: Proc. of the 1987 ACM- SIGMOD Conference on the Management of Data, San Francisco, CA, pp. 9–22 (May 1987)Google Scholar
- 14.Kennedy, J., Eberhart, R.C.: Swarm Intelligence. Morgan Kaufmann Publishers (2001)Google Scholar
- 15.Kirkpatrick, S., Gelatt Jr., C., Vecchi, M.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)MathSciNetCrossRefMATHGoogle Scholar
- 16.Kossmann, D.: The State of the Art in Distributed Query Processing. ACM Computing Surveys 32(4), 422–469 (2000)CrossRefGoogle Scholar
- 17.Nahar, S., Sahani, S., Shragowitz, E.: Simulated Annealing and Combinatorial Optimization. In: Proceedings of the 23rd Design Automation Conference, pp. 293–299 (1986)Google Scholar
- 18.Ozsu, M.T., Valduriez, P.: Distributed Database Systems: Where are we now? IEEE Computer 24(8), 68–78 (1991)CrossRefGoogle Scholar
- 19.Ozsu, M.T., Valduriez, P.: Principles of Distributed Database Systems, 3rd edn. Springer (2010)Google Scholar
- 20.Page, T.W., Popek, G.J.: Distributed data management in local area networks. In: Proc. ACM SIGACT–SIGMOD Symp. on Principles of Database Systems, pp. 135–142 (1985)Google Scholar
- 21.Sacco, M.S., Yao, S.B.: Query optimization in distributed data base systems. In: Yovits, M. (ed.) Advances in Computers, vol. 21, pp. 225–273 (1982)Google Scholar
- 22.Segev, A.: Optimization of join operations in horizontally partitioned database systems. ACM Transactions on Database Systems 11(1), 48–80 (1986)MathSciNetCrossRefGoogle Scholar
- 23.Swami, A., Gupta, A.: Optimization of large join queries. In: Proceedings of 1988 ACM-SIGMOD Conference, Chicago, pp. 8–17 (1998)Google Scholar
- 24.Vijay Kumar, T.V., Singh, V., Verma, A.K.: Distributed query processing plans generation using genetic algorithm. International Journal of Computer Theory and Engineering 3(1), 38–45 (2011)CrossRefGoogle Scholar