James Cheney
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
James Cheney has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Amal Ahmed
Northeastern University, Boston, USA
1 shared publication - Umut A. Acar
Programming Languages and Systems Group, Max Planck Institute for Software Systems, Germany
1 shared publication
Latest Publications
- 1 August 2011
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 21 (6) , 1301-1337
Provenance as dependency analysis
Provenance is information recording the source, derivation or history of some information. Provenance tracking has been studied in a variety of settings, particularly database management systems. However, although many candidate definitions of provenance have been proposed, the mathematical or semantic foundations of data provenance have received comparatively little attention. In this paper, we argue that dependency analysis techniques familiar from program analysis and program slicing provide a formal foundation for forms of provenance that are intended to show how (part of) the output of a query depends on (parts of) its input. We introduce a semantic characterisation of such dependency provenance for a core database query language, show that minimal dependency provenance is not computable, and provide dynamic and static approximation techniques. We also discuss preliminary implementation experience with using dependency provenance to compute data slices, or summaries of the parts of the input relevant to a given part of the output.
- 1 August 2011
- Published by Cambridge University Press (CUP) in Mathematical Structures in Computer Science
- Vol. 21 (6) , 1301-1337
Provenance as dependency analysis
Provenance is information recording the source, derivation or history of some information. Provenance tracking has been studied in a variety of settings, particularly database management systems. However, although many candidate definitions of provenance have been proposed, the mathematical or semantic foundations of data provenance have received comparatively little attention. In this paper, we argue that dependency analysis techniques familiar from program analysis and program slicing provide a formal foundation for forms of provenance that are intended to show how (part of) the output of a query depends on (parts of) its input. We introduce a semantic characterisation of such dependency provenance for a core database query language, show that minimal dependency provenance is not computable, and provide dynamic and static approximation techniques. We also discuss preliminary implementation experience with using dependency provenance to compute data slices, or summaries of the parts of the input relevant to a given part of the output.