Explaining Query Answer Completeness and Correctness with Partition Patterns

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Information incompleteness is a major data quality issue which is amplified by the increasing amount of data collected from unreliable sources. Assessing the completeness of data is crucial for determining the quality of the data itself, but also for verifying the validity of query answers over incomplete data. In this article, we tackle the issue of efficiently describing and inferring knowledge about data completeness w.r.t. to a complete reference data set and study the use of a partition pattern algebra for summarizing the completeness and validity of query answers. We describe an implementation and experiments with a real-world dataset to validate the effectiveness and the efficiency of our approach.

Cite

CITATION STYLE

APA

Hannou, F. Z., Amann, B., & Baazizi, M. A. (2019). Explaining Query Answer Completeness and Correctness with Partition Patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11707 LNCS, pp. 47–62). Springer. https://doi.org/10.1007/978-3-030-27618-8_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free