collaborators
Showing cs.DBShow all

5 papers · 1 filter

cs.DB2026

Practical MCTS-based Query Optimization: A Reproducibility Study and new MCTS algorithm for complex queries

Vladimir Burlakov, Alena Rybakina, Sergey Kudashev +4

Monte Carlo Tree Search (MCTS) has been proposed as a transformative approach to join-order optimization in database query processing, with recent frameworks such as AlphaJoin and…

cs.DB2025

Learning-Augmented Online Caching: New Upper Bounds

Daniel Skachkov, Denis Ponomaryov, Yuri Dorn +1

We address the problem of learning-augmented online caching in the scenario when each request is accompanied by a prediction of the next occurrence of the requested page. We improv…

cs.DB2025

The Selection Problem in Multi-Query Optimization: a Comprehensive Survey

Sergey Zinchenko, Denis Ponomaryov

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…

cs.DB2024

Adaptive Cost Model for Query Optimization

Nikita Vasilenko, Alexander Demin, Denis Ponomaryov

The principal component of conventional database query optimizers is a cost model that is used to estimate expected performance of query plans. The accuracy of the cost model has d…

cs.DB2024

EEvA: Fast Expert-Based Algorithms for Buffer Page Replacement

Alexander Demin, Yuriy Dorn, Aleksandr Katrutsa +4

Optimal page replacement is an important problem in efficient buffer management. The range of replacement strategies known in the literature varies from simple but efficient FIFO-b…