Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Oleksandr Havrylov

dblp:413/1958 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 67% Recommender systems · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
cost estimation
0.912025
Opening The Black-Box: Explaining Learned Cost Models For Databases · Proc. VLDB Endow. 2025
Recommender systems
explainable recommendation
0.912025
Opening The Black-Box: Explaining Learned Cost Models For Databases · Proc. VLDB Endow. 2025
Query processing and optimization › cost model
learned cost model
0.912025
Opening The Black-Box: Explaining Learned Cost Models For Databases · Proc. VLDB Endow. 2025

Methods — techniques the papers use, named apart from their topics

AI explainability · 0.9
YearPublicationVenuePosition
2025 Opening The Black-Box: Explaining Learned Cost Models For Databases
abstract
Learned Cost Model s (LCMs) have shown superior results over traditional database cost models as they can significantly improve the accuracy of cost predictions. However, LCMs still fail for some query plans, as prediction errors can be large in the tail. Unfortunately, recent LCMs are based on complex deep neural models, and thus, there is no easy way to understand where this accuracy drop is rooted, which critically prevents systematic troubleshooting. In this demo paper, we present the very first approach for opening the black box by bringing AI explainability approaches to LCMs. As a core contribution, we developed new explanation techniques that extend existing methods that are available for the general explainability of AI models and adapt them significantly to be usable for LCMs. In our demo, we provide an interactive tool to showcase how explainability for LCMs works. We believe this is a first step for making LCMs debuggable and thus paving the road for new approaches for systematically fixing problems in LCMs.
Roman Heinrich, Oleksandr Havrylov, Manisha Luthra, Johannes Wehrstein, Carsten Binnig
Proc. VLDB Endow.2