Database Queries that Explain their Work

James Cheney, Amal Ahmed, Umut A. Acar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationPPDP '14 Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming
Number of pages12
ISBN (Print)978-1-4503-2947-7
Publication statusPublished - 2014
EventPPDP 2014 - Canterbury, United Kingdom
Duration: 8 Sept 201410 Sept 2014


ConferencePPDP 2014
Country/TerritoryUnited Kingdom


Dive into the research topics of 'Database Queries that Explain their Work'. Together they form a unique fingerprint.

Cite this