On the Limitations of Provenance for Queries With Difference

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
Computer Sciences
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Amsterdamer, Yael
Deutch, Daniel
Contributor
Abstract

The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive query languages. The provenance semirings is a particular approach that was proven effective for these languages, and it was shown that when propagating provenancewith semirings, the expected equivalence axioms of the corresponding query languages are satisfied. There have been several attempts to extend the framework to account for relational algebra queries with difference. We show here that these suggestions fail to satisfy some expected equivalence axioms (that in particular hold for queries on “standard” set and bag databases). Interestingly, we show that this is not a pitfall of these particular attempts, but rather every such attempt is bound to fail in satisfying these axioms, for some semirings. Finally, we show particular semirings for which an extension for supporting difference is (im)possible.

Advisor
Date of presentation
2011-01-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T07:14:12.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Yael Amsterdamer (http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/a/Amsterdamer:Yael.html), Daniel Deutch (http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/d/Deutch:Daniel.html), Val Tannen: On the Limitations of Provenance for Queries With Difference (2011)
Recommended citation
Collection