Dynamic query optimisation: towards decentralised methods
by Franck Morvan, Abdelkader Hameurlain
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 3, No. 4, 2009

Abstract: The execution plans generated by relational query optimisers can be suboptimal because of the inaccuracies of estimations, the unavailability of resources and the instability of the execution environment. To detect and correct this suboptimality, several dynamic optimisation methods were proposed. In this paper, we present a synthesis of the main dynamic optimisation methods. First, we present a set of parameters allowing to characterise and compare dynamic optimisation methods. The comparison reveals that a method must be decentralised in a large-scale distributed environment. Finally, before concluding, we discuss the advantages and drawbacks of proposed decentralised methods.

Online publication date: Wed, 16-Dec-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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