Efficient GPU-accelerated Join Optimization for Complex Queries
Authors:
- 1 May 2022
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3190-3193
Abstract
Analytics on modern data analytic and data ware-house systems often need to run large complex queries on increasingly complex database schemas. A lot of progress has been made on executing such complex queries using techniques like scale out query processing, hardware accelerators like GPUs and code generation techniques. However, optimization of such queries remains a challenge. Existing optimal solutions either cannot be effectively parallelized, or are inefficient while doing a lot of unnecessary work. In this demonstration, we present our system, GPU-QO, which aims to demonstrate query optimization techniques for large analytical queries using GPUs. We first demonstrate Massively Parallel Dynamic Programming (MPDP) - a novel query optimization technique that can run on GPUs to generate optimal plans in a (massively) parallel and efficient manner. We then showcase IDP2-MPDP and UnionDP - two heuristic techniques, again using GPUs, that can even optimize queries containing 1000s of joins. Furthermore, we compare our techniques with current state-of-the-art solutions, and demonstrate how our techniques can reduce optimization time for optimal solutions by nearly two orders of magnitude and produce much better query plans for heuristics (up to 7x).Keywords
This publication has 6 references indexed in Scilit:
- Efficient Massively Parallel Join Optimization for Large Queries2022
- Adaptive Optimization of Very Large Join Queries2018
- Dependency-aware reordering for parallelizing query optimization in multi-core CPUs2009
- Iterative dynamic programmingACM Transactions on Database Systems, 2000
- A new heuristic for optimizing large queries1998
- Access path selection in a relational database management system1979