Explaining Query Answer Completeness and Correctness with Partition Patterns
| Autor: | Bernd Amann, Fatma-Zohra Hannou, Mohamed Amine Baazizi |
|---|---|
| Přispěvatelé: | Bases de Données (BD), LIP6, Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
050101 languages & linguistics
Correctness Information retrieval [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB] Computer science Data quality 05 social sciences 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences 02 engineering and technology Completeness (statistics) Partition (database) |
| Zdroj: | 30th International Conference on Database and Expert Systems Applications-DEXA 2019 30th International Conference on Database and Expert Systems Applications-DEXA 2019, Aug 2019, Linz, Austria. pp.47-62, ⟨10.1007/978-3-030-27618-8_4⟩ Lecture Notes in Computer Science ISBN: 9783030276171 DEXA (2) |
| Popis: | International audience; 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|