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,748 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 4.2897489e-05 |
| 10,009 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 4.1945683e-05 |
| 10,362 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS | 4.1945683e-05 |
| 10,918 | A faster FPRAS for #NFA | 2024 | PODS | 4.1945683e-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.00057857292 |
| 407 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00024004562 |
| 571 | The Complexity of Query Reliability | 1998 | PODS | 0.00019910719 |
| 1,268 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012931993 |
| 1,328 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012565612 |
| 3,314 | Computing Query Probability with Incidence Algebras | 2010 | PODS | 7.2318581e-05 |
| 7,601 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.698961e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,442 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS | 6.186154e-05 |
| 571 | The Complexity of Query Reliability | 1998 | PODS | 0.00019910719 |
| 12,356 | Query Evaluation with Soft-Key Constraints | 2008 | PODS | 4.1945683e-05 |
| 4,706 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB | 5.9820914e-05 |
| 8,992 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations | 2022 | PODS | 4.413099e-05 |
| 7,601 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 4.698961e-05 |
| 4,720 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB | 5.973811e-05 |
| 74 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00057857292 |
| 6,415 | Queries with Difference on Probabilistic Databases | 2011 | VLDB | 5.0731258e-05 |
| 6,169 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB | 5.1716068e-05 |