.png){kind=icon}
.png){kind=icon}
Return
Learned Optimizer for Online Approximate Query Processing in Data Exploration
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2024.3361989.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the interactive data exploration, approximate query processing (AQP) can be used to quickly return query results at the cost of accuracy. For online AQP, the sampler can be treated as an operator in the query plan. During the query optimization for AQP, heuristic rules are usually used to guide the sampler push-down. However, due to the complexity and changes of data distribution, the heuristic rule-based optimization methods cannot meet the users' query accuracy requirements. In this article, we propose a learning-based query optimization method for online AQP. We first introduce the weak equivalence concept and propose a series of push-down rules to guide the sampler push-down during the query optimization. Then, to enable more queries to meet the users' query accuracy requirements, we propose a deep learning model to further optimize the query plan. By using this model during each push-down process of the sampler, we try to avoid the negative effect of inappropriate sampler push-down on query accuracy, especially when there is an inconsistency between the underlying and intermediate data distribution. Extensive experiments show that the method proposed in this paper can outperform the state-of-the-art online sampling-based AQP method by 1.2X-7.9X in query accuracy.
Keywords:
Query processing
Predictive models
Deep learning
Adaptation models
Data models
Sparks
Optimization
Approximate query processing (AQP)
interactive data exploration
sampling
query optimization
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W