Skip to content

Tree-IS: Efficient Index Selection and Optimization Model for Dynamic Workloads.

Jul 2026 · IEEE Transactions on Neural Networks and Learning Systems · Vol PP, pp. 1-15 · 0 citations
Medicine

TL;DR

A network-optimized Monte Carlo tree search (NMCTS)-based index selection model, called tree-based index selection (Tree-IS), is proposed by using the sampling-based reinforcement learning algorithm Monte Carlo tree search (MCTS), achieving the rapid identification of optimal index sets and a significant improvement in query efficiency.

Abstract

Index selection is a crucial component in database query optimization. Traditional database index selection is inefficient when handling large-scale and complex structured query language (SQL) queries, and existing methods often overlook index maintenance costs and the necessity of updates. To address these issues, a network-optimized Monte Carlo tree search (NMCTS)-based index selection model, called tree-based index selection (Tree-IS), is proposed by using the sampling-based reinforcement learning algorithm Monte Carlo tree search (MCTS). This model compresses the action space through workload-driven query template extraction and candidate index (CI) generation techniques. It integrates a novel query state representor and an execution-plan-based index value model (IVM), accurately characterizing the database environment while providing reliable action criteria for index search. On this basis, Tree-IS further leverages a state abstraction network (SAN), a policy network, and a value network (VN) to optimize the search logic of MCTS, achieving the rapid identification of optimal index sets and a significant improvement in query efficiency. Extensive experiments are conducted on popular datasets, including join order benchmark (JOB), transaction processing performance council benchmark holistic (TPC-H), and transaction processing performance council benchmark decision support (TPC-DS), to evaluate the proposed method across multiple metrics. The results demonstrate that the quality of indices selected by the Tree-IS model is significantly superior to that of existing methods.

View source

Similar papers

Open access Sep 2026

Implementation and experimental evaluation of mint for workload-aware approximate nearest neighbor index tuning in multi-vector databases

Approximate nearest neighbor (ANN) search is an integral part of contemporary vector databases; however, the performance of this algorithm highly depends on the specifics of data, recall requirements, storage capabilities, and query workload. All these factors complicate ANN even further in multi-vector databases, wher...

S. Salunkhe, K. Vayadande, H. Khandagale et al. · 0 citations
Jul 2026

QBAT: Model-Based Query Budget Autotuner for Clustering-Based Approximate Nearest Neighbor Search

Two predictive models are explored: a highly accurate gradient-boosted decision tree and a simple, interpretable heuristic formula derived using the AlphaEvolve framework that can optimize budget allocation for both system performance or recall consistency priorities.

Jonghyun Bae, Tae Jun Ham, Alan Li et al. · 0 citations
Jul 2026

GAS: A Lightweight Framework for Filtered Search over Wide-Table Vectors

Graph with Adaptive Shortcuts (GAS), a framework that leverages historical query logs to build lightweight auxiliary structures, enhancing search efficiency over a single base graph with minimal overhead, and consistently outperforms existing general indexes in wide-table scenarios.

Zi-Yuan He, Yu-Xiang Wang, Yu Sun et al. · 0 citations
Jul 2026

Nav-Index: A High-Performance, Adaptive Index for Shortest Path Queries in RDBMS

Nav-Index is presented, an adaptive index for relational DBMS that accelerates large-scale shortest path queries with seamless integration into SQL and relational algebra and outperforms all other database systems that have been tested by orders of magnitude.

Maximilian Reif, Thomas Neumann · 0 citations
Open access Aug 2026

Efficient Storage and Query Optimization for Large-Scale Data Sets in Distributed Architectures

Experimental results demonstrate that the proposed optimization solution can effectively cut storage redundancy overhead, improve cluster resource utilization, drastically reduce query latency for large-scale data, and raise concurrent throughput.

Y.-G. Zhao · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.