Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/7739
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BUNEMAN, Peter | - |
dc.contributor.author | CHENEY, James | - |
dc.contributor.author | VANSUMMEREN, Stijn | - |
dc.date.accessioned | 2008-01-03T15:43:56Z | - |
dc.date.available | 2008-01-03T15:43:56Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | Database Theory - ICDT 2007. p. 209-223 | - |
dc.identifier.isbn | 3-540-69269-X | - |
dc.identifier.issn | 1611-3349 | - |
dc.identifier.uri | http://hdl.handle.net/1942/7739 | - |
dc.description.abstract | Information concerning the origin of data (that is, its provenance) is important in many areas, especially scientific recordkeeping. Currently, provenance information must be maintained explicitly, by added effort of the database maintainer. Since such maintenance is tedious and error-prone, it is desirable to provide support for provenance in the database system itself. In order to provide such support, however, it is important to provide a clear explanation of the behavior and meaning of existing database operations, both queries and updates, with respect to provenance. In this paper we take the view that a query or update implicitly defines a provenance mapping linking components of the output to the originating components in the input. Our key result is that the proposed semantics are expressively complete relative to natural classes of queries that explicitly manipulate provenance. | - |
dc.language.iso | en | - |
dc.publisher | Springer | - |
dc.relation.ispartofseries | Lecture Notes in Computer Science | - |
dc.subject.other | Computer science, provenance, nested relational calculus, nested relational algebra, expressiveness | - |
dc.title | On the Expressiveness of Implicit Provenance in Query and Update Languages | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Suciu, Dan | - |
local.bibliographicCitation.authors | Schwentick, Thomas | - |
local.bibliographicCitation.conferencedate | 2007 | - |
local.bibliographicCitation.conferencename | International Conference on Database Theory | - |
dc.bibliographicCitation.conferencenr | 11 | - |
local.bibliographicCitation.conferenceplace | Barcelona, Spain | - |
dc.identifier.epage | 223 | - |
dc.identifier.spage | 209 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 4353 | - |
dc.bibliographicCitation.oldjcat | C1 | - |
dc.identifier.doi | 10.1007/11965893_15 | - |
dc.identifier.isi | 000244800500015 | - |
local.bibliographicCitation.btitle | Database Theory - ICDT 2007 | - |
item.accessRights | Open Access | - |
item.fullcitation | BUNEMAN, Peter; CHENEY, James & VANSUMMEREN, Stijn (2007) On the Expressiveness of Implicit Provenance in Query and Update Languages. In: Database Theory - ICDT 2007. p. 209-223. | - |
item.contributor | BUNEMAN, Peter | - |
item.contributor | CHENEY, James | - |
item.contributor | VANSUMMEREN, Stijn | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
barcelona.pdf | Non Peer-reviewed author version | 263.8 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
15
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
6
checked on Apr 24, 2024
Page view(s)
60
checked on Sep 7, 2022
Download(s)
110
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.