Queries and materialized views on probabilistic databases

DOI10.1016/j.jcss.2010.04.006zbMath1215.68088OpenAlexW2136658073MaRDI QIDQ532366

Christopher Re, Dan Suciu, Nilesh N. Dalvi

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

zbMATH Keywords

query evaluationviewsprobabilistic databases

Mathematics Subject Classification ID

Database theory (68P15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data ⋮ Uncertain probabilistic range queries on multidimensional data ⋮ A dichotomy in the complexity of counting database repairs ⋮ First-order under-approximations of consistent query answers ⋮ Domination in the Probabilistic World ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A formal analysis of information disclosure in data exchange
• World-set decompositions: Expressiveness and efficient algorithms
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Incomplete Information in Relational Databases
• Monte-Carlo approximation algorithms for enumeration problems
• The Complexity of Enumeration and Reliability Problems
• Answering queries using views: A survey

This page was built for publication: Queries and materialized views on probabilistic databases