Efficiently and Effectively Answering Why-Not Questions based on Provenance Polynomials

Nicole Bidoit 1, 2, 3, 4 Melanie Herschel 2, 3, 4 Katerina Tzompanaki 2, 3, 4, 1
4 OAK - Database optimizations and architectures for complex large data
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
Abstract : The problem of answering Why-Not questions consists in explaining why the result of a query does not contain some expected data, i.e., missing answers. To solve this problem, we resort to identifying where in the query, data relevant to the missing answer were lost. Existing algorithms producing such query-based explanations rely on a query tree representation, potentially leading to different or partial explanations. This significantly impairs on the effectiveness of computed explanations. Here we present an effective, query-tree independent representation of query-based explanations, for a wide class of Why-Not questions, based on provenance polynomials. We further describe an algorithm that efficiently computes the complete set of these explanations. An experimental evaluation validates our statements
Liste complète des métadonnées

Cited literature [25 references]  Display  Hide  Download

Contributor : Aikaterini Tzompanaki <>
Submitted on : Saturday, March 14, 2015 - 12:05:49 AM
Last modification on : Monday, May 28, 2018 - 2:38:02 PM
Document(s) archivé(s) le : Sunday, September 13, 2015 - 9:25:48 PM


Files produced by the author(s)


  • HAL Id : hal-01131561, version 1


Nicole Bidoit, Melanie Herschel, Katerina Tzompanaki. Efficiently and Effectively Answering Why-Not Questions based on Provenance Polynomials. [Research Report] RR-8697, OAK team, Inria Saclay; INRIA. 2015, pp.25. ⟨hal-01131561⟩



Record views


Files downloads