Database Paper Browser

Back to papers

Approximating Predicates and Expressive Queries on Probabilistic Databases

Summary: Defines an expressive probabilistic-DB language with compositional confidence computation enabling conditional-probability queries and selections over marginal/conditional confidences. Characterizes complexity, gives approximation/error bounds, and an algorithm that efficiently approximates queries except at unavoidable singularities. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1450
Venue
PODS
Year
2008
Pagerank
6.186154e-05
Overall Rank
4,442 | 69.10%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
1,162 k-Nearest Neighbors in Uncertain Graphs 2010 VLDB 0.0001358105
1,730 Conditioning Probabilistic Databases 2008 VLDB 0.00010736755
3,251 On Probabilistic Fixpoint and Markov Chain Query Languages 2010 PODS 7.3215694e-05
4,720 Read-Once Functions and Query Evaluation in Probabilistic Databases 2010 VLDB 5.973811e-05
5,296 Running Tree Automata on Probabilistic XML 2009 PODS 5.5802694e-05
6,415 Queries with Difference on Probabilistic Databases 2011 VLDB 5.0731258e-05
7,434 Local Structure and Determinism in Probabilistic Databases 2012 SIGMOD 4.7314358e-05
12,213 Transducing Markov Sequences 2010 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers