Skip to Main content Skip to Navigation
Journal articles

Evaluating Top-k Queries with Inconsistency Degrees

Ousmane Issa 1 Angela Bonifati 2, 3, 4 Farouk Toumani 1
3 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
4 TYREX - Types and Reasoning for the Web
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : We study the problem of augmenting relational tuples with inconsistency awareness and tackling top-k queries under a set of denial constraints (DCs). We define a notion of inconsistent tuples with respect to a set of DCs and define two measures of inconsistency degrees, which consider single and multiple violations of constraints. In order to compute these measures, we leverage two models of provenance, namely why-provenance and provenance polynomials. We investigate top-k queries that allow to rank the answer tuples by their inconsistency degrees. Since one of our measure is monotonic and the other non-monotonic, we design an integrated top-k algorithm to compute the top-k results of a query w.r.t. both inconsistency measures. By means of an extensive experimental study, we gauge the effectiveness of inconsistency-aware query answering and the efficiency of our algorithm with respect to a baseline, where query results are fully computed and ranked afterwards.
Document type :
Journal articles
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Ousmane Issa Connect in order to contact the contributor
Submitted on : Tuesday, July 14, 2020 - 11:29:47 AM
Last modification on : Friday, February 4, 2022 - 3:12:14 AM
Long-term archiving on: : Tuesday, December 1, 2020 - 6:05:57 PM


Files produced by the author(s)



Ousmane Issa, Angela Bonifati, Farouk Toumani. Evaluating Top-k Queries with Inconsistency Degrees. Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2020, 13 (12), pp.2146-2158. ⟨10.14778/3407790.3407815⟩. ⟨hal-02898931⟩



Record views


Files downloads