The Selection Problem in Multi-Query Optimization: a Comprehensive Survey
Abstract
View materialization, index selection, and plan caching are well-known techniques for optimization of query processing in database systems. The essence of these tasks is to select and save a subset of the most useful candidates (views/indexes/plans) for reuse within given space/time budget constraints. In this paper, we propose a unified view on these selection problems. We make a detailed analysis of the root causes of their complexity and summarize techniques to address them. Our survey provides a modern classification of selection algorithms known in the literature, including the latest ones based on Machine Learning. We provide a ground for reuse of the selection techniques between different optimization scenarios and highlight challenges and promising directions in the field. Based on our analysis we derive a method to exponentially accelerate some of the state-of-the-art selection algorithms.
Cite
@article{arxiv.2412.11828,
title = {The Selection Problem in Multi-Query Optimization: a Comprehensive Survey},
author = {Sergey Zinchenko and Denis Ponomaryov},
journal= {arXiv preprint arXiv:2412.11828},
year = {2025}
}