Probabilistic Query Evaluation: The Combined FPRAS Landscape
Summary: FPRAS for probabilistic query evaluation (PQE) over tuple-independent databases for any class of self-join-free conjunctive queries with bounded hypertree width, running polynomially in both query length and instance size. Overcomes lineage blow-up and shows classes that are #P-hard to evaluate exactly but admit efficient combined-complexity approximation. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,747 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 4.2856385e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1905499e-05 |
| 10,374 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS | 4.1905499e-05 |
| 10,922 | A faster FPRAS for #NFA | 2024 | PODS | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057797415 |
| 401 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024281448 |
| 572 | The Complexity of Query Reliability | 1998 | PODS | 0.00019888988 |
| 1,269 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012911894 |
| 1,322 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012595941 |
| 3,315 | Computing Query Probability with Incidence Algebras | 2010 | PODS | 7.2247513e-05 |
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,439 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS | 6.1806955e-05 |
| 572 | The Complexity of Query Reliability | 1998 | PODS | 0.00019888988 |
| 12,364 | Query Evaluation with Soft-Key Constraints | 2008 | PODS | 4.1905499e-05 |
| 4,708 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB | 5.9763416e-05 |
| 8,994 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations | 2022 | PODS | 4.4094348e-05 |
| 7,604 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.6944524e-05 |
| 4,722 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.9646931e-05 |
| 6,410 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.0682868e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057797415 |
| 6,167 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1725053e-05 |