Robust Query Processing (Dagstuhl Seminar 12321)

@article{Graefe2012RobustQP,
  title={Robust Query Processing (Dagstuhl Seminar 12321)},
  author={G. Graefe and W. Guy and H. Kuno and G. Paulley},
  journal={Dagstuhl Reports},
  year={2012},
  volume={2},
  pages={1-15}
}
The 2012 Dagstuhl 12321 Workshop on Robust Query Processing, held from 5--10 August 2012, brought together researchers from both academia and industry to discuss various aspects of robustness in database management systems and ideas for future research. The Workshop was designed as a sequel to an earlier Workshop, Dagstuhl Workshop 10381, that studied a similar set of topics. In this article we summarize some of the main discussion topics of the 12321 Workshop, the results to date, and… Expand

Topics from this paper

Robust Performance in Database Query Processing
The Dagstuhl Seminar 17222 on “Robust performance in database query processing”, held from 28/May until 02/June 2017, brought together researchers from academia and industry to discuss aspects ofExpand
Robust Query Processing: Mission Possible
  • J. Haritsa
  • Computer Science
  • 2019 IEEE 35th International Conference on Data Engineering (ICDE)
  • 2019
TLDR
This tutorial will present these novel research approaches, characterize their strengths and limitations, and enumerate open technical problems that remain to be solved to make robust query processing a contemporary reality. Expand
Plan Bouquets : An Exploratory Approach to Robust Query Processing
TLDR
The proposed techniques include: Improving estimation accuracy through novel statistical models, sampling and execution-feedback mechanisms, and Dynamically changing plans at run-time if estimation errors are detected during the execution of the originally chosen plan. Expand
Plan bouquets: query processing without selectivity estimation
TLDR
The bouquet approach provides novel guarantees that open up new possibilities for robust query processing, and delivers substantial improvements in the worst-case behavior, without impairing the average-case performance, as compared to the native optimizers of these systems. Expand
Tempura: A General Cost Based Optimizer Framework for Incremental Data Processing (Extended Version)
TLDR
A novel cost-based optimizer framework, called Tempura, for optimizing incremental data processing, and an incremental query planning model called TIP based on the concept of time-varying relations, which can formally model incremental processing in its most general form. Expand
Plan Bouquets
TLDR
The conceptually new plan bouquet approach, wherein the compile-time estimation process is completely eschewed for error-prone selectivities, delivers substantial improvements in the worst-case behavior, without impairing the average-case performance, as compared to the native optimizers of these systems. Expand
Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data
TLDR
This work proposes a robust index for semi-structured hierarchical data that supports content-and-structure queries specified by path and value predicates, and shows important properties of the scheme, such as robustness against varying selectivities, and demonstrates improvements of up to two orders of magnitude over existing approaches. Expand
Robustness Metrics for Relational Query Execution Plans
TLDR
Three novel metrics for the robustness of relational query execution plans w.r.t. cardinality estimation errors are presented and a novel plan selection strategy is presented that takes both, estimated cost and estimated robustness into account, when choosing a plan for execution. Expand
Autonomic physical database design – from indexing to multidimensional clustering
TLDR
A survey on the state of the art in autonomic physical design in database design, starting with the classic index tuning problem and possible solutions, and describing further design problems such as choosing materializations of aggregations for OLAP and multidimensional clustering schemes. Expand
Smooth Scan: robust access path selection without cardinality estimation
TLDR
This paper designs and implements an adaptive access path operator called Smooth Scan, which morphs continuously within the space of index access and full table scan, and demonstrates robust, near-optimal performance on micro-benchmarks and real-life workloads, while being statistics oblivious at the same time. Expand
...
1
2
...