AUTONOMOUS INDEX RECOMMENDATION SYSTEM FOR RELATIONAL DATABASES BASED ON COST-MODEL AND PLAN COVERING

Authors

  • Vitalii Holubinka Lviv Polytechnic National University, Institute of Computer Sciences and Information Technologies, Department of Information Systems and Networks, Lviv,, Ukraine https://orcid.org/0009-0001-3676-3566

DOI:

https://doi.org/10.20535/kpisn.2026.2.352454

Keywords:

database indexing, query optimization, autonomous recommendation systems, cost mode, Plan Covering

Abstract

Background. Indexing is a key tool for improving the performance of relational databases, but manual index selection remains complex and subjective. As data volumes grow, the demands on the adaptability of optimization systems increase. Machine and deep learning-based approaches provide high accuracy, but require significant resources and have a “cold start” problem, which necessitates autonomous solutions with balanced accuracy and complexity characteristics.

Objective. Development and experimental evaluation of an autonomous index recommendation system that combines a cost-model with a Plan Covering algorithm to improve query performance in relational databases while simultaneously taking into account the cost of index storage.

Methods. The system has a pipeline architecture and includes a workload analyzer, a cost model, and a Plan Covering algorithm. The analyzer generates a query profile, the cost model evaluates their performance with hypothetical indexes, and the algorithm performs a greedy index selection based on the benefit-to-cost ratio. Experimental testing was performed on a synthetic e-commerce system dataset in the PostgreSQL environment.

Results. The system generated 7 index recommendations, of which 6 were successfully created. The average query execution time improvement was 22.54%, with the largest improvement (26.06%) being obtained for the most frequently executed query with the JOIN operation. The total execution time of all queries decreased from 0.2751 s to 0.2131 s.

Conclusions. The proposed combination of Cost-Model and Plan Covering provides effective automation of the indexing process without the use of resource-intensive neural network approaches, demonstrating a significant improvement in performance and rational use of storage resources.

 

References

S. Huang et al., “Survey on performance optimization for database systems,” Science China Information Sciences, vol. 66, no. 12, pp. 1–22, 2023. https://doi.org/10.1007/s11432-021-3578-6

J. Shi, G. Cong, and X. L. Li, “Learned index benefits: Machine learning based index performance estimation,” Proceedings of the VLDB Endowment, vol. 15, no. 13, pp. 3950–3962, 2022. https://doi.org/10.14778/3565838.3565848

H. Lan, Z. Bao, and Y. Peng, “An index advisor using deep reinforcement learning,” in Proceedings of the 29th ACM International Conference on Information and Knowledge Management (CIKM), 2020, pp. 2105-2108.

https://doi.org/10.1145/3340531.3412106

X. Huang, X. Gao, and G. Chen, “Ditune: A reinforcement learning based framework for automated database index selection,” in Proceedings of the 18th International Conference on Ubiquitous Information Management and Communication (IMCOM), 2024, pp. 1-8. https://doi.org/10.1109/IMCOM60618.2024.10418292

Downloads

Published

2026-06-29

Issue

Vol. 143 No. 2 (2026): KPI Science News

Section

articles

License

Copyright (c) 2026 Vitalii Holubinka

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

The ownership of copyright remains with the Authors.
 
Authors may use their own material in other publications provided that the Journal is acknowledged as the original place of publication and National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” as the Publisher.

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under CC BY 4.0 that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work