Database Queries that Explain their Work

Abstract : Provenance for database queries or scientific workflows is often motivated as providing explanation, increasing understanding of the underlying data sources and processes used to compute the query, and reproducibility, the capability to recompute the results on different inputs, possibly specialized to a part of the output. Many provenance systems claim to provide such capabilities; however, most lack formal definitions or guarantees of these properties, while others provide formal guarantees only for relatively limited classes of changes. Building on recent work on provenance traces and slicing for functional programming languages, we introduce a detailed tracing model of provenance for multiset-valued Nested Relational Calculus, define trace slicing algorithms that extract subtraces needed to explain or recompute specific parts of the output, and define query slicing and differencing techniques that support explanation. We state and prove correctness properties for these techniques and present a proof-of-concept implementation in Haskell.
Type de document :
Communication dans un congrès
PPDP 2014: 16th International Symposium on Principles and Practice of Declarative Programming, Sep 2014, Canterbury, United Kingdom. <10.1145/2643135.2643143>
Liste complète des métadonnées

https://hal.inria.fr/hal-01100324
Contributeur : Arthur Charguéraud <>
Soumis le : mardi 6 janvier 2015 - 11:46:38
Dernière modification le : lundi 5 octobre 2015 - 17:01:51

Identifiants

Collections

Citation

James Cheney, Ahmed Amal, Umut A. Acar. Database Queries that Explain their Work. PPDP 2014: 16th International Symposium on Principles and Practice of Declarative Programming, Sep 2014, Canterbury, United Kingdom. <10.1145/2643135.2643143>. <hal-01100324>

Partager

Métriques

Consultations de la notice

90