• Corpus ID: 173990194

Enriching Ontology-based Data Access with Provenance (Extended Version)

  title={Enriching Ontology-based Data Access with Provenance (Extended Version)},
  author={Diego Calvanese and Davide Lanti and A. Ozaki and Rafael Pe{\~n}aloza and Guohui Xiao},
Ontology-based data access (OBDA) is a popular paradigm for querying heterogeneous data sources by connecting them through mappings to an ontology. In OBDA, it is often difficult to reconstruct why a tuple occurs in the answer of a query. We address this challenge by enriching OBDA with provenance semirings, taking inspiration from database theory. In particular, we investigate the problems of (i) deciding whether a provenance annotated OBDA instance entails a provenance annotated conjunctive… 
Enriching Ontology-based Data Access with Provenance
This work investigates the problems of deciding whether a provenance annotated OBDA instance entails a provenances annotated conjunctive query, and computing a polynomial representing the provenance of a query entailed by a provenanced OBDA instances, and implements Task (ii) in a state-of-the-art OBDA system and shows the practical feasibility of the approach through an extensive evaluation against two popular benchmarks.


A General Framework for Representing, Reasoning and Querying with Annotated Semantic Web Data
A generic framework for representing and reasoning with annotated Semantic Web data is described, and a generic method for combining multiple annotation domains allowing to represent, e.g., temporally-annotated fuzzy RDF is provided.
Ontop: Answering SPARQL queries over relational databases
We present Ontop, an open-source Ontology-Based Data Access (OBDA) system that allows for querying relational data sources through a conceptual representation of the domain of interest, provided in
The NPD Benchmark: Reality Check for OBDA Systems
A novel benchmark for OBDA systems based on real data coming from the oil industry: the Norwegian Petroleum Directorate (NPD) FactPages is proposed, with novel techniques to generate, from the NPD data, datasets of increasing size, taking into account the requirements dictated by the OBDA setting.
Answering SPARQL Queries over Databases under OWL 2 QL Entailment Regime
We present an extension of the ontology-based data access platform Ontop that supports answering SPARQL queries under the OWL 2 QL direct semantics entailment regime for data instances stored in
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
It is shown that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in thesize of the ABox, which is the first result ofPolynomial-time data complexity for query answering over DL knowledge bases.
VIG: Data scaling for OBDA benchmarks
VIG, a data scaler for Ontology-Based Data Access (OBDA) benchmarks is described, which lifts the scaling approach from the pure database level to the OBDA level, where the domain information of ontologies and mappings has to be taken into account as well.
Queries with negation and inequalities over lightweight ontologies
A novel class of local CQs with inequalities, for which query answering over DL-Lite is decidable is identified, and syntactic restrictions are explored to attain efficient query answering with negated atoms.
Reasoning about Explanations for Negative Query Answers in DL-Lite
This work addresses the computational complexity of why a given tuple is missing in a query answer for arbitrary, subset minimal, and cardinality minimal explanations by adopting abductive reasoning.
Provenance semirings
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why-provenance are particular cases of the same general algorithms involving
ProvSQL: Provenance and Probability Management in PostgreSQL
This demonstration showcases ProvSQL, an open-source module for the PostgreSQL database management system that adds support for computation of provenance and probabilities of query results, and a large subset of non-aggregate SQL queries.