- Todd J. Green, G. Karvounarakis, V. Tannen
- Computer ScienceACM SIGACT-SIGMOD-SIGART Symposium on Principles…
- 11 June 2007
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and why-provenance are particular cases of the same general algorithms involving…
The iPlant Collaborative: Cyberinfrastructure for Plant Biology
These workshops teach researchers how to add bioinformatics tools and/or datasets into the iPlant cyberinfrastructure enabling plant scientists to perform complex analyses on large datasets without the need to master the command-line or high-performance computational services.
Principles of Programming with Complex Objects and Collection Types
Models for Incomplete and Probabilistic Information
The expressive power of c-tables over infinite domains is characterized and a new kind of result, algebraic completion, is introduced for studying less expressive models.
Naturally Embedded Query Languages
- V. Tannen, P. Buneman, L. Wong
- Computer ScienceInternational Conference on Database Theory
- 14 October 1992
A progression of sublanguages in this paradigm that have increasing expressive power are described, and robust conceptual restrictions are illustrated thus exhibiting interesting additional properties.
Query reformulation with constraints
In general, there may exist multiple such reformulations and choosing among them may require, for example, a cost model.
Putting Lipstick on Pig: Enabling Database-style Workflow Provenance
- Yael Amsterdamer, S. Davidson, Daniel Deutch, T. Milo, Julia Stoyanovich, V. Tannen
- Computer ScienceProceedings of the VLDB Endowment
- 1 December 2011
This work presents a novel provenance framework that marries database-style and workflow-style provenance, by using Pig Latin to expose the functionality of modules, thus capturing internal state and fine-grained dependencies.
Reformulation of XML Queries and Constraints
A completeness theorem is proved which guarantees that under certain conditions, this algorithm will find a minimal reformulation if one exists and conditions when this algorithm achieves optimal complexity bounds are identified.
K2/Kleisli and GUS: Experiments in integrated access to genomic data sources
This paper reports on the experiences with two systems that were developed at the University of Pennsylvania: K2, a view integration implementation, and GUS, a data warehouse.
Update Exchange with Mappings and Provenance
- Todd J. Green, G. Karvounarakis, Z. Ives, V. Tannen
- Computer ScienceVery Large Data Bases Conference
- 23 September 2007
This paper extends techniques from data integration, data exchange, and incremental view maintenance to propagate updates along mappings, and integrates a novel model for tracking data provenance, such that curators may filter updates based on trust conditions over this provenance.