Join Order Selection with Transfer Reinforcement Learning

The selection of the optimal join order is critical for the efficiency of join query execution. The addition of new tables or columns necessitates the retraining of existing reinforcement learning models from scratch, consuming a significant amount of time and computational resources. To address this problem, we proposes a transfer reinforcement learning method that utilizes policy distillation techniques to optimize join order selection. The proposed algorithm allows the policy from a trained model (teacher model) to be transferred to a new model (student model), significantly reducing training costs associated with model changes. Additionally, we introduced a matrix representing the join sequence to address the issue of different join orders in two different join trees resulting in identical encoding. The experiments demonstrate that this method reduces training time and improves the speed of query execution compared to existing algorithms.

Authors

Institutions

Publication Details

Published
2024-11-28
DOI
https://doi.org/10.1109/cbd65573.2024.00027
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Join Order Selection with Transfer Reinforcement Learning

Ping Shen, Zhewen Ding, Cheng Ding, Pan Su et al.
Neural Networks and Applications
article

Join Order Selection with Transfer Reinforcement Learning

Ping Shen, Zhewen Ding, Cheng Ding, Pan Su, YongPan Zhang, Zheng Zhang, Chao Qian
article en

Abstract

The selection of the optimal join order is critical for the efficiency of join query execution. The addition of new tables or columns necessitates the retraining of existing reinforcement learning models from scratch, consuming a significant amount of time and computational resources. To address this problem, we proposes a transfer reinforcement learning method that utilizes policy distillation techniques to optimize join order selection. The proposed algorithm allows the policy from a trained model (teacher model) to be transferred to a new model (student model), significantly reducing training costs associated with model changes. Additionally, we introduced a matrix representing the join sequence to address the issue of different join orders in two different join trees resulting in identical encoding. The experiments demonstrate that this method reduces training time and improves the speed of query execution compared to existing algorithms.

Nanjing University of Posts and Telecommunications (CN), China Telecom (China) (CN), China Telecom (CN)
Reduced inequalities
Openalex Percentile: Top 76%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.