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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Representing and querying correlated tuples in probabilistic databases (2007)

Cached

  • Download as a PDF

Download Links

  • [drum.lib.umd.edu]
  • [drum.lib.umd.edu]
  • [www.cs.umd.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [linqs.cs.umd.edu]
  • [www.cs.duke.edu]
  • [www.cs.umd.edu]
  • [www.cs.duke.edu]
  • [linqs.cs.umd.edu]
  • [www.cs.umd.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Prithviraj Sen , Amol Deshpande
Venue:In ICDE
Citations:140 - 11 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Sen07representingand,
    author = {Prithviraj Sen and Amol Deshpande},
    title = {Representing and querying correlated tuples in probabilistic databases},
    booktitle = {In ICDE},
    year = {2007}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of probabilistic databases is hampered by two limitations: (1) current probabilistic databases make simplistic assumptions about the data (e.g., complete independence among tuples) that make it difficult to use them in applications that naturally produce correlated data, and (2) most probabilistic databases can only answer a re-stricted subset of the queries that can be expressed using traditional query languages. We address both these limitations by proposing a framework that can represent not only probabilistic tuples, but also correlations that may be present among them. Our proposed framework naturally lends itself to the possible world semantics thus preserving the precise query semantics extant in current probabilistic databases. We develop an effi-cient strategy for query evaluation over such probabilistic databases by casting the query processing problem as an inference problem in an ap-propriately constructed probabilistic graphical model. We present several optimizations specific to probabilistic databases that enable efficient query evaluation. We validate our approach by presenting an experimental eval-uation that illustrates the effectiveness of our techniques at answering various queries using real and synthetic datasets. 1

Keyphrases

probabilistic database    correlated tuples    current probabilistic database    query evaluation    synthetic datasets    considerable attention    present several optimization    inference problem    possible world semantics    probabilistic tuples    widespread use    complete independence    query processing problem    many real world application    effi-cient strategy    probabilistic graphical model    simplistic assumption    various query    efficient query evaluation    uncertain data    experimental eval-uation    precise query semantics    re-stricted subset    traditional query language   

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