Davide Martinenghi

Prof. Dr. Davide Martinenghi

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 January 2014 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
DMDavide Martinenghi
Davide Martinenghi
RTRiccardo Torlone
Riccardo Torlone

18 December 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
PCPaolo Ciaccia
Paolo Ciaccia
DMDavide Martinenghi
Davide Martinenghi
Top- k queries, in particular those based on a linear scoring function, are a common way to extract relevant results from large datasets. Their major advantage over alternative approaches, such as skyline queries (which return all the undominated objects in a dataset), is that the cardinality of the output can be easily controlled through the k parameter and user preferences can be accommodated by appropriately weighing the involved attributes. In this paper we concentrate on two so-far neglected aspects of top- k queries: first, their general ability to return all the potentially interesting results, i.e., the tuples in the skyline; second, the difficulty that linear top- k queries might encounter in returning tuples with balanced attribute values that match user preferences more closely than tuples that are extremely good in one dimension but (very) poor in others. In order to quantify these undesirable effects we introduce four novel indicators for skyline tuples, which measure their robustness as well as the difficulty incurred by top-k queries to retrieve them. After observing that real datasets usually contain many relevant results that are hardly retrievable by linear top- k queries, and with the aim of favoring balanced results, we extend the queries with a term that accounts for the distance of a tuple from the preference direction established by the attributes' weights. This novel query, which we call directional query, adds the flexibility needed to allow each skyline tuple to be ranked first for a proper choice of weights, with no extra burden on the user and, in the most adverse scenarios, only a minor computational overhead, as measured through an extensive experimental analysis on real and synthetic data.

12 May 2010 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
ACAndrea Calì
Andrea Calì
DMDavide Martinenghi
Davide Martinenghi
Since Chen's Entity-Relationship (ER) model, conceptual modeling has been playing a fundamental role in relational data design. In this paper we consider an extended ER (EER) model enriched with cardinality constraints, disjointness assertions, and is a relations among both entities and relationships. In this setting, we consider the case of incomplete data, which is likely to occur, for instance, when data from different sources are integrated. In such a context, we address the problem of providing correct answers to conjunctive queries by reasoning on the schema. Based on previous results about decidability of the problem, we provide a query answering algorithm that performs rewriting of the initial query into a recursive Datalog query encoding the information about the schema. We finally show extensions to more general settings.

22 July 2010 in IEEE Internet Computing
Verified
Journal Article
Closed access
SCStefano Ceri
Stefano Ceri
AAAdnan Abid
Adnan Abid
MHMamoun Abu Helou
Mamoun Abu Helou
DBDavide Barbieri
Davide Barbieri
ABAlessandro Bozzon
Alessandro Bozzon
SVSalvatore Vadacca
Salvatore Vadacca
Search computing focuses on building answers to complex search queries (for example, "Where can I attend an interesting conference in my field near a sunny beach?") by interacting with a constellation of cooperating search services, and using result ranking and joining as the dominant factors for service composition. The service computing paradigm has so far been neutral to the specific features of search applications and services. To address this weakness, search computing advocates a new approach in which search, join, and ranking are the central aspects for service composition.

7 October 2016
Verified
Book Chapter
Closed access
PDF file
ACAndrea Calì
Andrea Calì
DMDavide Martinenghi
Davide Martinenghi
RTRiccardo Torlone
Riccardo Torlone

9 June 2024
Verified
Conference Paper
Open access
SCStefano Ceri
Stefano Ceri
Anna BernasconiAnna Bernasconi
Anna Bernasconi
AGAlessia Gagliardi
Alessia Gagliardi
DMDavide Martinenghi
Davide Martinenghi
LBLuigi Bellomarini
Luigi Bellomarini
DMDavide Magnanimi
Davide Magnanimi
Graph databases are emerging as the leading data management technology for storing large knowledge graphs; significant efforts are ongoing to produce new standards (such as the Graph Query Language, GQL), as well as enrich them with properties, types, schemas, and keys. In this article, we introduce PG-Triggers, a complete proposal for adding triggers to Property Graphs, along the direction marked by the SQL3 Standard. We define the syntax and semantics of PG-Triggers and then illustrate how they can be implemented on top of Neo4j, one of the most popular graph databases. In particular, we introduce a syntax-directed translation from PG-Triggers into Neo4j, which makes use of the so-called APOC triggers; APOC is a community-contributed library for augmenting the Cypher query language supported by Neo4j. We also cover Memgraph, and show that our approach applies to this system in a similar way. We illustrate the use of PG-Triggers through a life science application inspired by the COVID-19 pandemic. The main objective of this article is to introduce an active database standard for graph databases as a first-class citizen at a time when reactive graph management is in its infancy, so as to minimize the conversion efforts towards a full-fledged standard proposal.