This story on HackerNoon has a decentralized backup on Sia.
Transaction ID: 84LqyyBHRkHhhl9dnprjaxCSH66vqygUnYmr8OQ14oI
Cover

Adaptive Action Pruning: Scaling Index Selection for Unseen Workloads

Written by @instancing | Published on 2026/1/10

TL;DR
The paper is available under CC-SA 4.0 Deed Deed (Attribution-Non-Commercial Deed) license. The paper is also available on arxiv.com.

Abstract and 1. Introduction

  1. Related Works

    2.1 Traditional Index Selection Approaches

    2.2 RL-based Index Selection Approaches

  2. Index Selection Problem

  3. Methodology

    4.1 Formulation of the DRL Problem

    4.2 Instance-Aware Deep Reinforcement Learning for Efficient Index Selection

  4. System Framework of IA2

    5.1 Preprocessing Phase

    5.2 RL Training and Application Phase

  5. Experiments

    6.1 Experimental Setting

    6.2 Experimental Results

    6.3 End-to-End Performance Comparison

    6.4 Key Insights

  6. Conclusion and Future Work, and References

6.4 Key Insights

Summarizing our extensive experiments, IA2 represents a significant advancement in index selection, outperforming existing methods in several key areas:

Rapid Training Efficiency: IA2 excels with its unparalleled training speed, leveraging a what-if cost model and pre-trained models to facilitate quick adaptability and learning. This efficiency allows IA2 to drastically reduce training time compared to competitors, making it highly suitable for environments where speed is crucial.

Advanced Workload Modeling: Unlike static or exhaustive methods, IA2 employs dynamic workload modeling, enabling it to adapt to changing database queries and structures seamlessly. This flexibility ensures optimal index selection across diverse scenarios, including previously unseen workloads.

Effective Action Space Exploration: IA2 introduces an innovative approach to pruning and navigating the action space, efficiently identifying meaningful actions early in the training process. This strategy contrasts with the more resource-intensive techniques of SWIRL [6] or the rigid rules of Lan et al. [7], offering a balanced pathway to optimizing index configurations without exhaustive search or oversimplification.

Authors:

(1) Taiyi Wang, University of Cambridge, Cambridge, United Kingdom (Taiyi.Wang@cl.cam.ac.uk);

(2) Eiko Yoneki, University of Cambridge, Cambridge, United Kingdom (eiko.yoneki@cl.cam.ac.uk).


This paper is available on arxiv under CC BY-NC-SA 4.0 Deed (Attribution-Noncommercial-Sharelike 4.0 International) license.

[story continues]


Written by
@instancing
Pioneering instance management, driving innovative solutions for efficient resource utilization, and enabling a more sus

Topics and
tags
deep-reinforcement-learning|database-performance-ai|automated-index-selection|sql-query-optimization|workload-modeling|training-efficiency|tpc-h-benchmarking|adaptive-action-masking
This story on HackerNoon has a decentralized backup on Sia.
Transaction ID: 84LqyyBHRkHhhl9dnprjaxCSH66vqygUnYmr8OQ14oI