ABSTRACT
Query optimization is hard and the current proliferation of "modern" hardware does nothing to make it any easier. In addition, the tools that are commonly used by performance engineers, such as compiler intrinsics, static analyzers or hardware performance counters are neither integrated with data management systems nor easy to learn. This fact makes it (unnecessarily) hard to educate engineers, to prototype and to optimize database query plans for modern hardware. To address this problem, we developed a system called Candomblé that lets database performance engineers interactively examine, optimize and evaluate query plans using a touch-based interface. Candomblé puts attendants in the place of a physical query optimizer that has to rewrite a physical query plan into a better equivalent plan. Attendants experience the challenges when ad-hoc optimizing a physical plan for processing devices such as GPUs and CPUs and capture their gained knowledge in rules to be used by a rule-based optimizer.
- Crotty, A., Galakatos, A., Dursun, K., Kraska, T., Cetintemel, U., and Zdoni, S. Tupleware:" big" data, big analytics, small clusters. In CIDR (2015).Google Scholar
- Klonatos, Y., Koch, C., Rompf, T., and Chafi, H. Building efficient query engines in a high-level language. PVLDB (2014). Google ScholarDigital Library
- Neumann, T. Efficiently compiling efficient query plans for modern hardware. PVLDB (2011). Google ScholarDigital Library
- Patterson, D. A., and Ditzel, D. R. The case for the reduced instruction set computer. SIGARCH Comput. Archit. News (October 1980). Google ScholarDigital Library
- Pirk, H., Moll, O., Zaharia, M., and Madden, S. Voodoo - a vector algebra for portable database performance on modern hardware. In Submitted for Review (2016).Google ScholarDigital Library
Index Terms
- What Makes a Good Physical plan?: Experiencing Hardware-Conscious Query Optimization with Candomblé
Recommendations
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database TheoryThe problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...
Efficient Top-k Query Answering through its Top-N Rewritings Using Views
PIKM '15: Proceedings of the 8th Workshop on Ph.D. Workshop in Information and Knowledge ManagementRecently, various algorithms were proposed to speed up top-k query answering by using multiple materialized query results. Nevertheless, for most of the proposed algorithms, a potentially costly view selection operation is required. In fact, the ...
gFOV: A Full-Stack SPARQL Query Optimizer & Plan Visualizer
CIKM '23: Proceedings of the 32nd ACM International Conference on Information and Knowledge ManagementSPARQL is the standard query language for RDF data. A SPARQL query consists of basic graph patterns (BGPs), which are matched onto the data graph, and graph pattern operators, which specify how to merge the matched results. Despite the prevalence of ...
Comments