The Complexity of Query Reliability
Summary: Demonstrates that computing query reliability over tuple-independent probabilistic databases jumps from PTIME for quantifier-free queries to FP#P-complete already for some conjunctive queries, and that FP#P characterizes reliability for broad classes (incl. all SO queries). Provides randomized approximation algorithms for all polynomial-time-evaluable queries and extends FP#P hardness to metafinite databases with interpreted functions and SQL-style aggregates (first-order queries included). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Erich Grädel (RWTH Aachen University)
- 2. Yuri Gurevich (University of Michigan)
- 3. Colin Hirsch (RWTH Aachen University)
BibTeX Citation
@inproceedings{gradel_pods98,
address = {New York, NY, USA},
series = {{PODS} '98},
title = {{The Complexity of Query Reliability}},
url = {https://dl.acm.org/doi/10.1145/275487.295124},
doi = {10.1145/275487.295124},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Grädel, Erich and Gurevich, Yuri and Hirsch, Colin},
year = {1998}
}Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,130 | The reliability of queries (Extended Abstract) | 1995 | PODS | 8.9957534e-05 |
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,426 | Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds | 2021 | SIGMOD |
| 2 | 9,169 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 7,466 | Probabilistic Query Evaluation: The Combined FPRAS Landscape | 2023 | PODS |
| 4 | 5,340 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB |
| 5 | 421 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 6 | 8,407 | Counting Database Repairs Entailing a Query: The Case of Functional Dependencies | 2022 | PODS |
| 7 | 51 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 8 | 1,735 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 9 | 4,213 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS |
| 10 | 2,130 | The reliability of queries (Extended Abstract) | 1995 | PODS |