TY - GEN
T1 - Guiding Index Tuning Exploration with Potential Estimation
AU - Luo, Kecheng
AU - Ma, Ruiyang
AU - Cai, Peng
AU - Zhou, Aoying
AU - Ye, Zhiwei
AU - Cai, Dunbo
AU - Qian, Ling
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Throughout index tuning, existing index advisors allocate tuning budget equally across all queries in the workload, even though a considerable portion of queries benefit negligible from index tuning, leading to high costs and inefficiency. This paper introduces a novel learning-based index advisor named GITEE, which increases tuning efficiency and effectiveness by intelligently guiding the exploration of the large search space on candidate index. Our solution consists of three components. First, we utilize execution plan and predicate information to accurately estimate the maximum improvement indexing can bring, which serves as preliminary knowledge for reasonable tuning budget allocation. Second, we filter out queries based on the impact of indexing on the individual queries and their influence on others, thereby reducing the number of candidate indexes. Third, we leverage a Monte Carlo Tree Search-based solution, guided by the knowledge, to accelerate the selection of high-quality index configurations within the valuable search space. Extensive experiments across various benchmarks demonstrate that GITEE achieves superior tuning performance compared to state-of-theart heuristic or learning-based index advisors, while reducing tuning overhead by 1-2 orders of magnitude.
AB - Throughout index tuning, existing index advisors allocate tuning budget equally across all queries in the workload, even though a considerable portion of queries benefit negligible from index tuning, leading to high costs and inefficiency. This paper introduces a novel learning-based index advisor named GITEE, which increases tuning efficiency and effectiveness by intelligently guiding the exploration of the large search space on candidate index. Our solution consists of three components. First, we utilize execution plan and predicate information to accurately estimate the maximum improvement indexing can bring, which serves as preliminary knowledge for reasonable tuning budget allocation. Second, we filter out queries based on the impact of indexing on the individual queries and their influence on others, thereby reducing the number of candidate indexes. Third, we leverage a Monte Carlo Tree Search-based solution, guided by the knowledge, to accelerate the selection of high-quality index configurations within the valuable search space. Extensive experiments across various benchmarks demonstrate that GITEE achieves superior tuning performance compared to state-of-theart heuristic or learning-based index advisors, while reducing tuning overhead by 1-2 orders of magnitude.
KW - database
KW - index selection
KW - machine learning
UR - https://www.scopus.com/pages/publications/105015587197
U2 - 10.1109/ICDE65448.2025.00116
DO - 10.1109/ICDE65448.2025.00116
M3 - 会议稿件
AN - SCOPUS:105015587197
T3 - Proceedings - International Conference on Data Engineering
SP - 1496
EP - 1508
BT - Proceedings - 2025 IEEE 41st International Conference on Data Engineering, ICDE 2025
PB - IEEE Computer Society
T2 - 41st IEEE International Conference on Data Engineering, ICDE 2025
Y2 - 19 May 2025 through 23 May 2025
ER -