The VLDB Journal

, Volume 17, Issue 2, pp 243–264

Databases with uncertainty and lineage

Authors

    • Google Inc.
  • Anish Das Sarma
    • Stanford University
  • Alon Halevy
    • Google Inc.
  • Martin Theobald
    • Stanford University
  • Jennifer Widom
    • Stanford University
Special Issue Paper

DOI: 10.1007/s00778-007-0080-z

Cite this article as:
Benjelloun, O., Das Sarma, A., Halevy, A. et al. The VLDB Journal (2008) 17: 243. doi:10.1007/s00778-007-0080-z

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—data-minimal 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. We also show how uldbs enable a new approach to query processing in probabilistic databases. Finally, we describe the current state of the Trio system, our implementation of uldbs under development at Stanford.

Keywords

Uncertainty in DatabasesLineageProvenanceProbabilistic data management

Copyright information

© Springer-Verlag 2008