Queries and materialized views on probabilistic databases
From MaRDI portal
Publication:532366
DOI10.1016/J.JCSS.2010.04.006zbMATH Open1215.68088OpenAlexW2136658073MaRDI QIDQ532366FDOQ532366
Christopher Re, Nilesh N. Dalvi, Dan Suciu
Publication date: 4 May 2011
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2010.04.006
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Database theory (68P15)
Cites Work
- Incomplete Information in Relational Databases
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Complexity of Enumeration and Reliability Problems
- Monte-Carlo approximation algorithms for enumeration problems
- Answering queries using views: A survey
- World-set decompositions: Expressiveness and efficient algorithms
- A formal analysis of information disclosure in data exchange
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data
- Uncertain probabilistic range queries on multidimensional data
- Domination in the probabilistic world: computing skylines for arbitrary correlations and ranking semantics
- Query answering over inconsistent knowledge bases: a probabilistic approach
- First-order under-approximations of consistent query answers
- A dichotomy in the complexity of counting database repairs
Recommendations
This page was built for publication: Queries and materialized views on probabilistic databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q532366)
