• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

ULDBs: Databases with uncertainty and lineage (2006)

Cached

  • Download as a PDF

Download Links

  • [www.cs.brown.edu]
  • [www.cs.duke.edu]
  • [ilpubs.stanford.edu:8090]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [cs.brown.edu]
  • [ilpubs.stanford.edu:8090]
  • [www.vldb.org]
  • [ids.postech.ac.kr]
  • [ids.postech.ac.kr]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Omar Benjelloun , Anish Das Sarma , Alon Halevy , Jennifer Widom
Venue:IN VLDB
Citations:310 - 32 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Benjelloun06uldbs:databases,
    author = {Omar Benjelloun and Anish Das Sarma and Alon Halevy and Jennifer Widom},
    title = {ULDBs: Databases with uncertainty and lineage},
    booktitle = {IN VLDB},
    year = {2006},
    pages = {953--964},
    publisher = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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.

Keyphrases

uncertain data    uldb representation    input data    many application    consistent representation    straightforward implementation    new approach    trio system    important area    database subset    probabilistic database    base data    interconnected uncertainty    uldb minimality dataminimal    relational database    query result    data management    study minimization    data lineage    computational benefit    many relational operation    expressive construct    lineage enables    query processing    new operation   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University