Distributed query plan generation using multi-objective particle swarm optimisation Online publication date: Mon, 17-Aug-2015
by Amit Kumar; Rahul Singh; T.V. Vijay Kumar
International Journal of Collaborative Intelligence (IJCI), Vol. 1, No. 2, 2015
Abstract: Processing of distributed queries in an efficient manner entails generating query plans that would minimise the total query processing cost. The number of possible query plans increases exponentially with an increase in the number of relations accessed by the distributed query, as well as the number of sites where these relations reside. Consequently, it becomes infeasible to explore all possible query plans. In this paper, this problem has been addressed as a bi-objective optimisation problem with the two objectives being the minimisation of the number of sites involved in processing the distributed query and the maximisation of the concentration of relations in these involved sites. This problem has been solved using the set-based comprehensive learning parallel particle swarm optimisation (S-CLPPSO). Experimental results show that the S-CLPPSO-based distributed query plan generation algorithm is able to generate Top-K query plans that would result in efficient processing of a distributed query.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Collaborative Intelligence (IJCI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook