%0 Conference Paper %1 DBLP:conf/vldb/BenjellounSHW06 %A Benjelloun, Omar %A Sarma, Anish Das %A Halevy, Alon Y. %A Widom, Jennifer %B VLDB %D 2006 %K * pdm %P 953-964 %T ULDBs: Databases with Uncertainty and Lineage. %X This paper introduces ULDBs, an extension of relational databases with simple yet expressive constructs for representing and manipulating both lineage and uncertainty. Uncertain data and data lineage are two important areas of data management that have been considered extensively in isolation, however many applications require the features in tandem. Fundamentally, lineage enables simple and consistent representation of uncertain data, it correlates uncertainty in query results with uncertainty in the input data, and query processing with lineage and uncertainty together presents computational benefits over treating them separately. We show that the ULDB representation is complete, and that it permits straightforward implementation of many relational operations. We define two notions of ULDB minimality—dataminimal and lineage-minimal—and study minimization of ULDB representations under both notions. With lineage, derived relations are no longer self-contained: their uncertainty depends on uncertainty in the base data. We provide an algorithm for the new operation of extracting a database subset in the presence of interconnected uncertainty. Finally, we show how ULDBs enable a new approach to query processing in probabilistic databases. ULDBs form the basis of the Trio system under development at Stanford.

@inproceedings{DBLP:conf/vldb/BenjellounSHW06, abstract = {This paper introduces ULDBs, an extension of relational databases with simple yet expressive constructs for representing and manipulating both lineage and uncertainty. Uncertain data and data lineage are two important areas of data management that have been considered extensively in isolation, however many applications require the features in tandem. Fundamentally, lineage enables simple and consistent representation of uncertain data, it correlates uncertainty in query results with uncertainty in the input data, and query processing with lineage and uncertainty together presents computational benefits over treating them separately. We show that the ULDB representation is complete, and that it permits straightforward implementation of many relational operations. We define two notions of ULDB minimality—dataminimal and lineage-minimal—and study minimization of ULDB representations under both notions. With lineage, derived relations are no longer self-contained: their uncertainty depends on uncertainty in the base data. We provide an algorithm for the new operation of extracting a database subset in the presence of interconnected uncertainty. Finally, we show how ULDBs enable a new approach to query processing in probabilistic databases. ULDBs form the basis of the Trio system under development at Stanford.}, added-at = {2007-06-28T15:22:30.000+0200}, author = {Benjelloun, Omar and Sarma, Anish Das and Halevy, Alon Y. and Widom, Jennifer}, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {https://www.bibsonomy.org/bibtex/28e07832eb64ed8616831bfaa0ee623b1/juliengaugaz}, booktitle = {VLDB}, crossref = {DBLP:conf/vldb/2006}, description = {DBLP Record 'conf/vldb/BenjellounSHW06'}, ee = {http://www.vldb.org/conf/2006/p953-benjelloun.pdf}, interhash = {4c72cb427cd4043b966b502659e10777}, intrahash = {8e07832eb64ed8616831bfaa0ee623b1}, keywords = {* pdm}, pages = {953-964}, timestamp = {2007-06-28T15:30:21.000+0200}, title = {ULDBs: Databases with Uncertainty and Lineage.}, year = 2006 }