Efficient Computation of Polynomial Explanations of Why-Not Questions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Efficient Computation of Polynomial Explanations of Why-Not Questions

Résumé

Answering a Why-Not question consists in explaining why a query result does not contain some expected data, called missing answers. This paper focuses on processing Why-Not questions in a query-based approach that identifies the culprit query components. Our first contribution is a general definition of a Why-Not explanation by means of a polynomial. Intuitively, the polynomial provides all possible explanations to explore in order to recover the missing answers, together with an estimation of the number of recoverable answers. Moreover, this formalism allows us to represent Why-Not explanations in a unified way for extended relational models with probabilistic or bag semantics. We further present an algorithm to efficiently compute the polynomial for a given Why-Not question. An experimental evaluation demonstrates the practicality of the solution both in terms of efficiency and explanation quality, compared to existing algorithms.
Fichier principal
Vignette du fichier
CIKM2015.pdf (779.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01182101 , version 1 (06-08-2015)

Identifiants

Citer

Nicole Bidoit, Melanie Herschel, Aikaterini Tzompanaki. Efficient Computation of Polynomial Explanations of Why-Not Questions. 24th ACM International Conference on Information and Knowledge Management - CIKM 2015, Oct 2015, Melbourne, Australia. ⟨10.1145/2806416.2806426⟩. ⟨hal-01182101⟩
212 Consultations
125 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More