Ordering selection operators under partial ignorance

Alyoubi, K.H. and Helmer, S. and Wood, Peter T. (2015) Ordering selection operators under partial ignorance. In: UNSPECIFIED (ed.) Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. New York, U.S.: Association For Computing Machinery, pp. 1521-1530. ISBN 9781450337946.

Abstract

Optimising queries in real-world situations under imperfect conditions is still a problem that has not been fully solved. We consider finding the optimal order in which to execute a given set of selection operators under partial ignorance of their selectivities. The selectivities are modelled as intervals rather than exact values and we apply a concept from decision theory, the minimisation of the maximum regret, as a measure of optimality. The associated decision problem turns out to be NP-hard, which renders a brute-force approach to solving it impractical. Nevertheless, by investigating properties of the problem and identifying special cases which can be solved in polynomial time, we gain insight that we use to develop a novel heuristic for solving the general problem. We also evaluate minmax regret query optimisation experimentally, showing that it outperforms a currently employed strategy of optimisers that uses mean values for uncertain parameters.

Metadata

Statistics

DownloadsShow export options

Export as XMLJSONCSV

Activity Overview

6 month trend

393Downloads

6 month trend

270Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item