Davide Martinenghi
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
Davide Martinenghi has a total of 46 co-authors. Here are the top co-authors by number of shared publications:
- Riccardo Torlone
Università Roma Tre Italy
6 shared publications - Paolo Ciaccia
DISI, Università di Bologna, Bologna, Italy
5 shared publications - Andrea Cali
Computing Laboratory, University of Oxford, Eagle House, Walton Well Road, Oxford OX2 6ED, UK
2 shared publications - Andrea Calì
University of London
2 shared publications - Chiara Criscuolo
Politecnico di Milano Milan Italy
2 shared publications - Emilio De Lorenzis
Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Piazza Leonardo 32, 20133 Milan, Italy
2 shared publications
Latest Publications
- Open Access
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2549-2559
SERA: Evaluating LLM-based SEmantic RAnking over Structured Tables
- 6 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2549-2559
Open AccessSERA: Evaluating LLM-based SEmantic RAnking over Structured Tables
- Open Access
- 13 August 2026
- Published by MDPI AG in Sustainability
- Vol. 18 (16) , 8295
A Data Preparation Pipeline for Regional Weather Condition Correlation Analysis of Power Grid Outages in Italy
The resilience of electricity networks to extreme weather is an essential component of sustainable energy systems, as power interruptions can affect essential services, economic activities, public safety, and the integration of renewable energy sources. However, this assessment can be challenging due to the inherent differences and complexities between weather and grid data. To address this issue, we developed a data pipeline to acquire, prepare, and integrate power grid outage records, meteorological measurements, and lightning strike data into a unified relational database. The framework was applied to the Italian power grid, with detailed regional analyses conducted for Piedmont and Campania. The results show that, for more than 90% of the matched weather-related failures, at least one relevant weather condition was identified in the integrated datasets. Rainfall showed the most widespread association with failures throughout the year, while lightning was particularly relevant during summer and snowfall during colder months. The proposed framework provides a reproducible basis for monitoring weather-related infrastructure vulnerability and can support evidence-based maintenance prioritization, climate adaptation, and resilience-oriented grid planning. By facilitating the identification of regional risk patterns, the approach contributes to the development of more reliable and sustainable electricity infrastructure.
- 13 August 2026
- Published by MDPI AG in Sustainability
- Vol. 18 (16) , 8295
Open AccessA Data Preparation Pipeline for Regional Weather Condition Correlation Analysis of Power Grid Outages in Italy
The resilience of electricity networks to extreme weather is an essential component of sustainable energy systems, as power interruptions can affect essential services, economic activities, public safety, and the integration of renewable energy sources. However, this assessment can be challenging due to the inherent differences and complexities between weather and grid data. To address this issue, we developed a data pipeline to acquire, prepare, and integrate power grid outage records, meteorological measurements, and lightning strike data into a unified relational database. The framework was applied to the Italian power grid, with detailed regional analyses conducted for Piedmont and Campania. The results show that, for more than 90% of the matched weather-related failures, at least one relevant weather condition was identified in the integrated datasets. Rainfall showed the most widespread association with failures throughout the year, while lightning was particularly relevant during summer and snowfall during colder months. The proposed framework provides a reproducible basis for monitoring weather-related infrastructure vulnerability and can support evidence-based maintenance prioritization, climate adaptation, and resilience-oriented grid planning. By facilitating the identification of regional risk patterns, the approach contributes to the development of more reliable and sustainable electricity infrastructure.
- Open Access
- 25 September 2025
- Published by Elsevier in Information and Software Technology
- Vol. 189
FAIR-CARE: A comparative evaluation of unfairness mitigation approaches
- 25 September 2025
- Published by Elsevier in Information and Software Technology
- Vol. 189
Open AccessFAIR-CARE: A comparative evaluation of unfairness mitigation approaches
- 10 July 2025
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 43 (1) , 1-18
Optimization strategies for parallel computation of skylines
- 10 July 2025
- Published by Springer Nature in Distributed and Parallel Databases
- Vol. 43 (1) , 1-18
Optimization strategies for parallel computation of skylines
- Open Access
Computing Non-Dominated Flexible Skylines in Vertically Distributed Datasets with No Random Access
In today’s data-driven world, algorithms operating with vertically distributed datasets are crucial due to the increasing prevalence of large-scale, decentralized data storage. These algorithms process data locally, thereby reducing data transfer and exposure to breaches, while at the same time improving scalability thanks to data distribution across multiple sources. Top-k queries are a key tool in vertically distributed scenarios and are widely applied in critical applications involving sensitive data. Classical top-k algorithms typically resort to sorted access to sequentially scan the dataset and to random access to retrieve a tuple by its id. However, the latter kind of access is sometimes too costly to be feasible, and algorithms need to be designed for the so-called “no random access” (NRA) scenario. The latest efforts in this direction do not cover the recent advances in ranking queries, which propose hybridizations of top-k queries (which are preference-aware and control the output size) and skyline queries (which are preference-agnostic and have uncontrolled output size). The non-dominated flexible skyline () is one such proposal, which tries to obtain the best of top-k and skyline queries. We introduce an algorithm for computing in the NRA scenario, prove its correctness and optimality within its class, and provide an experimental evaluation covering a wide range of cases, with both synthetic and real datasets.Open AccessComputing Non-Dominated Flexible Skylines in Vertically Distributed Datasets with No Random Access
In today’s data-driven world, algorithms operating with vertically distributed datasets are crucial due to the increasing prevalence of large-scale, decentralized data storage. These algorithms process data locally, thereby reducing data transfer and exposure to breaches, while at the same time improving scalability thanks to data distribution across multiple sources. Top-k queries are a key tool in vertically distributed scenarios and are widely applied in critical applications involving sensitive data. Classical top-k algorithms typically resort to sorted access to sequentially scan the dataset and to random access to retrieve a tuple by its id. However, the latter kind of access is sometimes too costly to be feasible, and algorithms need to be designed for the so-called “no random access” (NRA) scenario. The latest efforts in this direction do not cover the recent advances in ranking queries, which propose hybridizations of top-k queries (which are preference-aware and control the output size) and skyline queries (which are preference-agnostic and have uncontrolled output size). The non-dominated flexible skyline () is one such proposal, which tries to obtain the best of top-k and skyline queries. We introduce an algorithm for computing in the NRA scenario, prove its correctness and optimality within its class, and provide an experimental evaluation covering a wide range of cases, with both synthetic and real datasets. - 10 May 2025
- Published by Springer Nature
- p. 14-18
Access Pattern
- Open Access
- 4 March 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 141
Partitioning Strategies for Parallel Computation of Flexible Skylines
While classical skyline queries identify interesting data within large datasets, flexible skylines introduce preferences through constraints on attribute weights, and further reduce the data returned. However, computing these queries can be time-consuming for large datasets. We propose and implement a parallel computation scheme consisting of a parallel phase followed by a sequential phase, and apply it to flexible skylines. We assess the additional effect of an initial filtering phase to reduce dataset size before parallel processing, and the elimination of the sequential part (the most time-consuming) altogether. All our experiments are executed in the PySpark framework for a number of different datasets of varying sizes and dimensions.
- 4 March 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 141
Open AccessPartitioning Strategies for Parallel Computation of Flexible Skylines
While classical skyline queries identify interesting data within large datasets, flexible skylines introduce preferences through constraints on attribute weights, and further reduce the data returned. However, computing these queries can be time-consuming for large datasets. We propose and implement a parallel computation scheme consisting of a parallel phase followed by a sequential phase, and apply it to flexible skylines. We assess the additional effect of an initial filtering phase to reduce dataset size before parallel processing, and the elimination of the sequential part (the most time-consuming) altogether. All our experiments are executed in the PySpark framework for a number of different datasets of varying sizes and dimensions.
- Open Access
- 20 February 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 123
Simplified Integrity Checking for an Expressive Class of Denial Constraints
Data integrity is crucial for ensuring data correctness and quality and is maintained through integrity constraints that must be continuously checked, especially in data-intensive systems like OLTP. While DBMSs handle very simple cases of constraints (such as primary key and foreign key constraints) well, more complex constraints often require ad hoc solutions. Research since the 1980s has focused on automatic and simplified integrity constraint checking, leveraging the assumption that databases are consistent before updates. This paper presents program transformation operators to generate simplified integrity constraints, focusing on complex constraints expressed in denial form. In particular, we target a class of integrity constraints, called extended denials, which are more general than tuple-generating dependencies and equality-generating dependencies. One of the main contributions of this study consists in the automatic treatment of such a general class of constraints, encompassing the all the most useful and common cases of constraints adopted in practice. Another contribution is the applicability of the proposed technique with a “preventive” approach; unlike all other methods for integrity maintenance, we check whether an update will violate the constraints before executing it, so we never have to undo any work, with potentially huge savings in terms of execution overhead. These techniques can be readily applied to standard database practices and can be directly translated into SQL.
- 20 February 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (3) , 123
Open AccessSimplified Integrity Checking for an Expressive Class of Denial Constraints
Data integrity is crucial for ensuring data correctness and quality and is maintained through integrity constraints that must be continuously checked, especially in data-intensive systems like OLTP. While DBMSs handle very simple cases of constraints (such as primary key and foreign key constraints) well, more complex constraints often require ad hoc solutions. Research since the 1980s has focused on automatic and simplified integrity constraint checking, leveraging the assumption that databases are consistent before updates. This paper presents program transformation operators to generate simplified integrity constraints, focusing on complex constraints expressed in denial form. In particular, we target a class of integrity constraints, called extended denials, which are more general than tuple-generating dependencies and equality-generating dependencies. One of the main contributions of this study consists in the automatic treatment of such a general class of constraints, encompassing the all the most useful and common cases of constraints adopted in practice. Another contribution is the applicability of the proposed technique with a “preventive” approach; unlike all other methods for integrity maintenance, we check whether an update will violate the constraints before executing it, so we never have to undo any work, with potentially huge savings in terms of execution overhead. These techniques can be readily applied to standard database practices and can be directly translated into SQL.
- Open Access
A Tutorial On Intersectionality in Fair Rankings
We address the critical issue of biased algorithms and unfair rankings, which have permeated various sectors, including search engines, recommendation systems, and workforce management. These biases can lead to discriminatory outcomes in a data-driven world, especially against marginalized and underrepresented groups. Efforts towards responsible data science and responsible artificial intelligence aim to mitigate these biases and promote fairness, diversity, and transparency. However, most fairness-aware ranking methods singularly focus on protected attributes such as race, gender, or socio-economic status, neglecting the intersectionality of these attributes, i.e., the interplay between multiple social identities. Understanding intersectionality is crucial to ensure that existing inequalities are not preserved by fair rankings. We offer a description of the main ways to incorporate intersectionality in fair ranking systems through practical examples and provide a comparative overview of existing literature and a synoptic table summarizing the various methodologies. Our analysis highlights the need for intersectionality to attain fairness, while also emphasizing that fairness, alone, does not necessarily imply intersectionality.
Open AccessA Tutorial On Intersectionality in Fair Rankings
We address the critical issue of biased algorithms and unfair rankings, which have permeated various sectors, including search engines, recommendation systems, and workforce management. These biases can lead to discriminatory outcomes in a data-driven world, especially against marginalized and underrepresented groups. Efforts towards responsible data science and responsible artificial intelligence aim to mitigate these biases and promote fairness, diversity, and transparency. However, most fairness-aware ranking methods singularly focus on protected attributes such as race, gender, or socio-economic status, neglecting the intersectionality of these attributes, i.e., the interplay between multiple social identities. Understanding intersectionality is crucial to ensure that existing inequalities are not preserved by fair rankings. We offer a description of the main ways to incorporate intersectionality in fair ranking systems through practical examples and provide a comparative overview of existing literature and a synoptic table summarizing the various methodologies. Our analysis highlights the need for intersectionality to attain fairness, while also emphasizing that fairness, alone, does not necessarily imply intersectionality.
- Open Access
Towards a visually interpretable analysis of Two-Phase Locking membership
Two-phase locking (2PL) is a consolidated policy commonly adopted by Database Management Systems to enforce serializability of a schedule. While the policy is well understood, both in its standard and in the strict version, automatically deriving a suitable tabular/graphical analysis of schedules with respect to 2PL is far from trivial, and requires several technicalities that do not straightforwardly translate to visual cues. In this paper, we delve into the details of the development of a tool for 2PL analysis.
Open AccessTowards a visually interpretable analysis of Two-Phase Locking membership
Two-phase locking (2PL) is a consolidated policy commonly adopted by Database Management Systems to enforce serializability of a schedule. While the policy is well understood, both in its standard and in the strict version, automatically deriving a suitable tabular/graphical analysis of schedules with respect to 2PL is far from trivial, and requires several technicalities that do not straightforwardly translate to visual cues. In this paper, we delve into the details of the development of a tool for 2PL analysis.