Name
Abstract | ||
|---|---|---|
Join order selection plays an important role in DBMS query optimizers. The problem aims to find the optimal join order with the minimum cost, and usually becomes an NP-hard problem due to the exponentially increasing search space. Recent advanced studies attempt to use deep reinforcement learning (DRL) to generate better join plans than the ones provided by conventional query optimizers. However, DRL-based methods require time-consuming training, which is not suitable for online applications that need frequent periodic re-training. In this paper, we propose a novel framework, namely efficient Join Order selection learninG with Graph-basEd Representation (JOGGER). We firstly construct a schema graph based on the primary-foreign key relationships, from which table representations are well learned to capture the correlations between tables. The second component is the state representation, where a graph convolutional network is utilized to encode the query graph and a tailored-tree-based attention module is designed to encode the join plan. To speed up the convergence of DRL training process, we exploit the idea of curriculum learning, in which queries are incrementally added into the training set according to the level of difficulties. We conduct extensive experiments on JOB and TPC-H datasets, which demonstrate the effectiveness and efficiency of the proposed solutions. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1145/3534678.3539303 | KDD '22: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Chen | 1 | 0 | 0.34 |
| Guanyu Ye | 2 | 0 | 0.34 |
| Yan Zhao | 3 | 45 | 9.79 |
| Shuncheng Liu | 4 | 0 | 0.34 |
| Liwei Deng | 5 | 0 | 0.34 |
| Xu Chen | 6 | 0 | 1.35 |
| Rui Zhou | 7 | 21 | 17.94 |
| Kai Zheng | 8 | 936 | 69.43 |