A relational framework for inconsistency-aware query answering - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2020

A relational framework for inconsistency-aware query answering

Farouk Toumani
  • Function : Author
  • PersonId : 1076767

Abstract

We introduce a novel framework for encoding inconsistency into relational tuples and tackling query answering for union of con-junctive queries (UCQs) with respect to a set of denial constraints (DCs). We define a notion of inconsistent tuple with respect to a set of DCs and define four measures of inconsistency degree of an answer tuple of a query. Two of these measures revolve around the minimal number of inconsistent tuples necessary to compute the answer tuples of a UCQ, whereas the other two rely on the maximum number of inconsistent tuples under set-and bag-semantics, respectively. In order to compute these measures of inconsistency degree, we leverage two models of provenance semiring, namely why-provenance and provenance polynomials, which can be computed in polynomial time in the size of the relational instances for UCQs. Hence, these measures of inconsistency degree are also computable in polynomial time in data complexity. We also investigate top-k and bounded query answering by ranking the answer tuples by their inconsistency degrees. We explore both a full materialized approach and a semi-materialized approach for the computation of top-k and bounded query results.
Fichier principal
Vignette du fichier
BDA_paper_framework_aware_inconsistancy.pdf (856.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02934283 , version 1 (09-09-2020)

Identifiers

  • HAL Id : hal-02934283 , version 1

Cite

Ousmane Issa, Angela Bonifati, Farouk Toumani. A relational framework for inconsistency-aware query answering. 2020. ⟨hal-02934283⟩
84 View
101 Download

Share

Gmail Facebook X LinkedIn More