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
- 1. Timothy van Bremen (National University of Singapore)
- 2. Kuldeep S. Meel (National University of Singapore)
BibTeX Citation
@inproceedings{bremen_pods23,
address = {New York, NY, USA},
series = {{PODS} '23},
title = {{Probabilistic Query Evaluation: The Combined FPRAS Landscape}},
url = {https://dl.acm.org/doi/10.1145/3584372.3588677},
doi = {10.1145/3584372.3588677},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {van Bremen, Timothy and Meel, Kuldeep S.},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,921 | Combined Approximations for Uniform Operational Consistent Query Answering | 2024 | PODS | 5.1955087e-05 |
| 10,182 | The Space-Time Complexity of Sum-Product Queries | 2026 | PODS | 5.093636e-05 |
| 10,655 | Towards Practical FPRAS for #NFA: Exploiting the Power of Dependence | 2025 | PODS | 5.093636e-05 |
| 11,139 | A faster FPRAS for #NFA | 2024 | PODS | 5.093636e-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 |
|---|---|---|---|---|
| 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB | 0.00043596705 |
| 382 | Conjunctive-Query Containment and Constraint Satisfaction | 1998 | PODS | 0.00019546431 |
| 644 | The Complexity of Query Reliability | 1998 | PODS | 0.00015367965 |
| 814 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00013841737 |
| 1,041 | The Dichotomy of Conjunctive Queries on Probabilistic Structures | 2007 | PODS | 0.00012453494 |
| 3,229 | Computing Query Probability with Incidence Algebras | 2010 | PODS | 7.6209731e-05 |
| 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS | 5.5638493e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,136 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS |
| 2 | 644 | The Complexity of Query Reliability | 1998 | PODS |
| 3 | 12,549 | Query Evaluation with Soft-Key Constraints | 2008 | PODS |
| 4 | 4,098 | Aggregation in Probabilistic Databases via Knowledge Compilation | 2012 | VLDB |
| 5 | 9,036 | Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations | 2022 | PODS |
| 6 | 7,706 | Conjunctive Queries on Probabilistic Graphs: Combined Complexity | 2017 | PODS |
| 7 | 4,301 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 8 | 6,527 | Queries with Difference on Probabilistic Databases | 2011 | VLDB |
| 9 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 10 | 5,225 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB |