Verena Kantere
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Verena Kantere has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Amin Kamali
University of Ottawa, Ottawa, Canada
4 shared publications - Baoming Chang
University of Ottawa, Ottawa, Canada
2 shared publications - Damianos Chatziantoniou
Athens University of Economics and Business
2 shared publications - Laurent D ' Orazio
Univ Rennes, CNRS, IRISA
2 shared publications - Paraskevas Kerasiotis
School of Electrical and Computer Engineering, National Technical University of Athens, Greece
2 shared publications - Trung-Dung Le
Thuyloi University
2 shared publications
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 138-148
Synthetic Data Generation to Accelerate Early-Stage Materials Damage Analysis in Mechanical Engineering
- 2 September 2026
- Published by Springer Nature
- p. 138-148
Synthetic Data Generation to Accelerate Early-Stage Materials Damage Analysis in Mechanical Engineering
- 3 August 2026
- Published by Springer Nature
- p. 158-163
PhenoNorm: A Phenology-Aligned Framework for Robust Multi-country Crop Yield Prediction
- 3 August 2026
- Published by Springer Nature
- p. 158-163
PhenoNorm: A Phenology-Aligned Framework for Robust Multi-country Crop Yield Prediction
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-27
Reqo: A Comprehensive Learning-Based Cost Model for Robust and Explainable Query Optimization
Although machine learning (ML) shows potential in improving query optimization by generating and selecting more efficient plans, ensuring the robustness of learning-based cost models (LCMs) remains challenging. These LCMs currently lack explainability, which undermines user trust and limits the ability to derive insights from their cost predictions to improve plan quality. Accurately converting tree-structured query plans into representations via tree models is also essential, as omitting any details may negatively impact subsequent cost model performance. Additionally, inherent uncertainty in cost estimation leads to inaccurate predictions, resulting in suboptimal plan selection. To address these challenges, we introduce Reqo, a R obust and E xplainable Q uery O ptimization cost model that comprehensively enhances three main stages in query optimization: plan generation, plan representation, and plan selection. Reqo integrates three innovations: the first explainability technique for LCMs that quantifies subgraph contributions and produces plan generation hints to enhance candidate plan quality; a novel tree model based on Bidirectional Graph Neural Networks (Bi-GNNs) with a Gated Recurrent Unit (GRU) aggregator to further capture both node-level and structural information and effectively strengthen plan representation; and an uncertainty-aware learning-to-rank cost estimator that adaptively integrates cost estimates with uncertainties to enhance plan selection robustness. Extensive experiments demonstrate that Reqo outperforms state-of-the-art approaches across all three stages.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-27
Open AccessReqo: A Comprehensive Learning-Based Cost Model for Robust and Explainable Query Optimization
Although machine learning (ML) shows potential in improving query optimization by generating and selecting more efficient plans, ensuring the robustness of learning-based cost models (LCMs) remains challenging. These LCMs currently lack explainability, which undermines user trust and limits the ability to derive insights from their cost predictions to improve plan quality. Accurately converting tree-structured query plans into representations via tree models is also essential, as omitting any details may negatively impact subsequent cost model performance. Additionally, inherent uncertainty in cost estimation leads to inaccurate predictions, resulting in suboptimal plan selection. To address these challenges, we introduce Reqo, a R obust and E xplainable Q uery O ptimization cost model that comprehensively enhances three main stages in query optimization: plan generation, plan representation, and plan selection. Reqo integrates three innovations: the first explainability technique for LCMs that quantifies subgraph contributions and produces plan generation hints to enhance candidate plan quality; a novel tree model based on Bidirectional Graph Neural Networks (Bi-GNNs) with a Gated Recurrent Unit (GRU) aggregator to further capture both node-level and structural information and effectively strengthen plan representation; and an uncertainty-aware learning-to-rank cost estimator that adaptively integrates cost estimates with uncertainties to enhance plan selection robustness. Extensive experiments demonstrate that Reqo outperforms state-of-the-art approaches across all three stages.
- 18 August 2025
- Published by Springer Nature
- p. 163-177
A Model-Based Approach for Simple Construction and Efficient Evaluation of Dataframes
- 18 August 2025
- Published by Springer Nature
- p. 163-177
A Model-Based Approach for Simple Construction and Efficient Evaluation of Dataframes
- Open Access
A Novel Framework Using Deep Reinforcement Learning for Join Order Selection
Join order selection is a sub-field of query optimization that aims to find the optimal join order for an SQL query with the minimum cost. The challenge lies in the exponentially growing search space as the number of tables increases, making exhaustive enumeration impractical. Traditional optimizers use static heuristics to prune the search space, but they often fail to adapt to changes or improve based on feedback from the DBMS. Recent research addresses these limitations with Deep Reinforcement Learning (DRL), allowing models to use feedback to dynamically search for better join orders and enhance performance over time. Existing research primarily focuses on capturing join order sequences and their representations at various levels, with limited comparative analysis of reinforcement learning methods. In this paper, we propose GTDD, a novel framework that integrates Graph Neural Networks (GNN), Treestructured Long Short-Term Memory (Tree LSTM), and DuelingDQN. We conduct a series of experiments that demonstrate a clear advantage of GTDD over state-of the-art techniques.
Open AccessA Novel Framework Using Deep Reinforcement Learning for Join Order Selection
Join order selection is a sub-field of query optimization that aims to find the optimal join order for an SQL query with the minimum cost. The challenge lies in the exponentially growing search space as the number of tables increases, making exhaustive enumeration impractical. Traditional optimizers use static heuristics to prune the search space, but they often fail to adapt to changes or improve based on feedback from the DBMS. Recent research addresses these limitations with Deep Reinforcement Learning (DRL), allowing models to use feedback to dynamically search for better join orders and enhance performance over time. Existing research primarily focuses on capturing join order sequences and their representations at various levels, with limited comparative analysis of reinforcement learning methods. In this paper, we propose GTDD, a novel framework that integrates Graph Neural Networks (GNN), Treestructured Long Short-Term Memory (Tree LSTM), and DuelingDQN. We conduct a series of experiments that demonstrate a clear advantage of GTDD over state-of the-art techniques.
- 18 August 2024
- Published by Springer Nature
- p. 299-314
A Novel Technique for Query Plan Representation Based on Graph Neural Nets
- 18 August 2024
- Published by Springer Nature
- p. 299-314
A Novel Technique for Query Plan Representation Based on Graph Neural Nets
- 2 July 2024
- Published by Springer Nature
- p. 298-315
Form-Based Semantic Caching on Time Series
- Open Access
- 9 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 468-471
RobOpt: A Tool for Robust Workload Optimization Based on Uncertainty-Aware Machine Learning
Relational database management systems (RDBMSs) employ query optimizers to search for execution plans deemed optimal for specific queries. Classical optimizers rely on inaccurate parameter estimates and assumptions that may not hold true in real-world scenarios. Consequently, suboptimal execution plans may be chosen, leading to poor query execution performance. Recent proposals of learned query optimizers that leverage Machine Learning suffer also from the selection of suboptimal plans. In order to fill this gap, we have created Robust Workload Optimization (RobOpt), a prototype tool that facilitates robust execution of a query workload in RDBMSs. It implements a novel technique that takes workload logs as input, generates training samples, and trains a risk-aware learned cost model. It optimizes risk-aware plan selection strategies to achieve a desired level of runtime performance and robustness. In addition, it analyzes a workload according to its training samples and determines an optimal plan selection strategy either at the workload or query level. Ultimately, it enables the robust execution of any workload by determining an optimal plan selection strategy per query. RobOpt can work on top of any RDBMS.
- 9 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 468-471
Open AccessRobOpt: A Tool for Robust Workload Optimization Based on Uncertainty-Aware Machine Learning
Relational database management systems (RDBMSs) employ query optimizers to search for execution plans deemed optimal for specific queries. Classical optimizers rely on inaccurate parameter estimates and assumptions that may not hold true in real-world scenarios. Consequently, suboptimal execution plans may be chosen, leading to poor query execution performance. Recent proposals of learned query optimizers that leverage Machine Learning suffer also from the selection of suboptimal plans. In order to fill this gap, we have created Robust Workload Optimization (RobOpt), a prototype tool that facilitates robust execution of a query workload in RDBMSs. It implements a novel technique that takes workload logs as input, generates training samples, and trains a risk-aware learned cost model. It optimizes risk-aware plan selection strategies to achieve a desired level of runtime performance and robustness. In addition, it analyzes a workload according to its training samples and determines an optimal plan selection strategy either at the workload or query level. Ultimately, it enables the robust execution of any workload by determining an optimal plan selection strategy per query. RobOpt can work on top of any RDBMS.
- 21 October 2023
- Published by Springer Nature
- p. 483-495
Federated Learning Performance on Early ICU Mortality Prediction with Extreme Data Distributions
- 21 October 2023
- Published by Springer Nature
- p. 483-495
Federated Learning Performance on Early ICU Mortality Prediction with Extreme Data Distributions
- 10 August 2023
- Published by Springer Nature
- p. 340-355
Data-driven and On-Demand Conceptual Modeling