Approximation schemes for many-objective query optimization

@article{Trummer2014ApproximationSF,
  title={Approximation schemes for many-objective query optimization},
  author={Immanuel Trummer and Christoph E. Koch},
  journal={Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data},
  year={2014}
}
The goal of multi-objective query optimization (MOQO) is to find query plans that realize a good compromise between conflicting objectives such as minimizing execution time and minimizing monetary fees in a Cloud scenario. A previously proposed exhaustive MOQO algorithm needs hours to optimize even simple TPC-H queries. This is why we propose several approximation schemes for MOQO that generate guaranteed near-optimal plans in seconds where exhaustive optimization takes hours. We integrated all… Expand
A Fast Randomized Algorithm for Multi-Objective Query Optimization
TLDR
This work presents the first algorithm with polynomial complexity in the query size, randomized and iterative, that can optimize queries with hundreds of tables and outperforms other randomized algorithms such as the NSGA-II genetic algorithm over a wide range of scenarios. Expand
Multi-objective parametric query optimization
TLDR
This paper introduces the multi-objective parametric query optimization (MPQO) problem where query plans are compared according to multiple cost metrics and the cost of a given plan according to a given metric is modeled as a function that depends on multiple parameters. Expand
Multi-Objective Parametric Query Optimization
TLDR
This work presents an algorithm that solves the MPQ problem and finds for a given query the set of all relevant query plans, which contains all plans that realize optimal execution cost tradeoffs for any combination of parameter values. Expand
An Incremental Anytime Algorithm for Multi-Objective Query Optimization
TLDR
An incremental anytime algorithm for MOQO is presented, its complexity is analyzed and it is shown that it offers an attractive tradeoff between result update frequency, single invocation time complexity, and amortized time over multiple invocations. Expand
Multi-objective Parametric Query Optimization for Distributed Database Systems
TLDR
Performance of MPQO variants based on nature-inspired optimization; ‘Multi-Objective Genetic Algorithm’ and a parameter-less optimization ‘Teaching-learning- based optimization’ are analyzed. Expand
Continuous Weighted-Sum based Multi-Objective Query Optimization on Mobile Cloud DataBase
Optimizing queries on mobile cloud databases has to consider several objectives simultaneously, such as query execution time and monetary cost occurred on the mobile device to execute queries. ThereExpand
From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization
TLDR
It is shown that integer programming solvers, massively parallel clusters, and adiabatic quantum annealers enable us to solve query optimization problem instances that are far beyond the capabilities of prior approaches. Expand
DR-QPO: DISCRETE RANK BASED QUERY PATTERN OPTIMIZATION TOWARDS PARALLEL QUERY PLANNING AND EXECUTION FOR DISTRIBUTE TRIPLE STORES
This manuscript proposed and explored a novel strategy for query pattern optimization towards parallel query planning and execution in Distributed RDF environments. The critical objective of theExpand
Spark-based Cloud Data Analytics using Multi-Objective Optimization
TLDR
UDAO is presented, a Spark-based Unified Data Analytics Optimizer that can automatically determine a cluster configuration with a suitable number of cores as well as other system parameters that best meet the task objectives. Expand
Boosting Cloud Data Analytics using Multi-Objective Optimization
TLDR
A principled multi-objective optimization approach that computes a Pareto optimal set of job configurations to reveal tradeoffs between different user objectives, recommends a new job configuration that best explores such tradeoffs, and employs novel optimizations to enable such recommendations within a few seconds is presented. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 33 REFERENCES
Design and Analysis of Parametric Query Optimization Algorithms
TLDR
The approach is based on the property that for linear cost functions, each parametric optimal plan is optimal in a convex polyhedral region of the parameter space, which is used to optimize linear and non-linear cost functions. Expand
Multiobjective query optimization
TLDR
It is shown that the optimum cost-delay trade-off (Pareto) curve in Mariposa's framework can be approximated fast within any desired accuracy, and a polynomial algorithm is presented for the general multiobjective query optimization problem, which approximates arbirarily well the optimum Cost- delay tradeoff. Expand
Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints
TLDR
This work develops algorithms that preprocess relations and construct indices to efficiently provide answers to OPAC queries, and presents the results of a thorough experimental evaluation analyzing the impact of several parameters on the accuracy and performance of the techniques. Expand
Parametric query optimization
TLDR
This work adopts randomized algorithms as the main approach toParametric query optimization and enhances them with a sideways information passing feature that increases their effectiveness in the new task, without much sacrifice in the output quality and with essentially zero run-time overhead. Expand
Least expected cost query optimization: what can we expect?
TLDR
It is shown that focusing on least expected cost can lead to significant improvement for a number of cost functions of interest. Expand
Schedule optimization for data processing flows on the cloud
TLDR
This paper studies scheduling of dataflows that involve arbitrary data processing operators in the context of three different problems and presents an approximate optimization framework to address them that uses resource elasticity in the cloud. Expand
Progressive Parametric Query Optimization
TLDR
This paper introduces algorithms that, as parametric plans are populated, are able to frequently bypass the optimizer but still execute optimal or near-optimal plans. Expand
Iterative dynamic programming: a new class of query optimization algorithms
TLDR
This paper presents and thoroughly evaluate a new class of query optimization algorithms that are based on a principle that is called iterative dynamic programming, or IDP for short, and has several important advantages. Expand
Towards a robust query optimizer: a principled and practical approach
TLDR
The robust cardinality estimation technique that is proposed allows for a user- or application-specified trade-off between performance and predictability, and it captures multi-dimensional correlations while remaining space- and time-efficient. Expand
Proactive re-optimization
Traditional query optimizers rely on the accuracy of estimated statistics to choose good execution plans. This design often leads to suboptimal plan choices for complex queries, since errors inExpand
...
1
2
3
4
...