Sara Magliacane

Reconstructing provenance

Provenance is an increasingly important aspect of data management that is often underestimated and neglected by practitioners. In our work, we target the problem of reconstructing provenance of files in a shared folder setting, assuming that only standard filesystem metadata are available. We propose a content-based approach that is able to reconstruct provenance automatically, leveraging several similarity measures and edit distance algorithms, adapting and integrating them into a multi-signal pipeline. We discuss our research methodology and show some promising preliminary results.

Efficient execution of top-k SPARQL queries

Top-k queries, i.e. queries returning the top k results ordered by a user-defined scoring function, are an important category of queries. Order is an important property of data that can be exploited to speed up query processing. State-of-the-art SPARQL engines underuse order, and top-k queries are mostly managed with a materialize-then-sort processing scheme that computes all the matching solutions (e.g. thousands) even if only a limited number k (e.g. ten) are requested. The

Hubble: Linked Data Hub for Clinical Decision Support

\mathcal{S}

Who are we talking about?: identifying scientific populations online

PARQL-

Efficient Execution of Top-K SPARQL Queries

\mathcal{R}

Git2PROV: exposing version control system content as W3C PROV

ANK algebra is an extended SPARQL algebra that treats order as a first class citizen, enabling efficient split-and-interleave processing schemes that can be adopted to improve the performance of top-k SPARQL queries. In this paper we propose an incremental execution model for

Automatic Metadata Annotation through Reconstructing Provenance

\mathcal{S}

Extending SPARQL algebra to support efficient evaluation of top-k SPARQL queries

PARQL-

Towards Reconstructing the Provenance of Clinical Guidelines

\mathcal{R}

FoxPSL: An Extended and Scalable PSL Implementation

ANK queries, we compare the performance of alternative physical operators, and we propose a rank-aware join algorithm optimized for native RDF stores. Experiments conducted with an open source implementation of a