The reliability of queries (Extended Abstract)
Summary: Defines query "reliability" p_Q(DB) as the probability that Q evaluated on a random noisy instance equals Q on the original DB under various corruption models. Shows FO queries have polynomial-time computable reliability, Datalog queries are #P-hard, and offers estimation approaches for natural distributions. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michel de Rougemont (University of Paris)
BibTeX Citation
@inproceedings{rougemont_pods95,
address = {New York, NY, USA},
series = {{PODS} '95},
title = {{The reliability of queries (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/212433.212479},
doi = {10.1145/212433.212479},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {de Rougemont, Michel},
year = {1995}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 574 | Management of Probabilistic Data: Foundations and Challenges | 2007 | PODS | 0.00016278855 |
| 644 | The Complexity of Query Reliability | 1998 | PODS | 0.00015367965 |
| 3,318 | On the Complexity of Managing Probabilistic XML Data | 2007 | PODS | 7.5247776e-05 |
| 4,136 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS | 6.8810237e-05 |
| 5,318 | Cleaning Uncertain Data with Quality Guarantees | 2008 | VLDB | 6.2672687e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 0 of 0 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,590 | On Probabilistic Fixpoint and Markov Chain Query Languages | 2010 | PODS |
| 2 | 414 | On the Complexity of Database Queries (Extended Abstract) | 1997 | PODS |
| 3 | 5,890 | An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs | 2019 | VLDB |
| 4 | 5,225 | Approximate Lifted Inference with Probabilistic Databases | 2015 | VLDB |
| 5 | 13,136 | Evaluating the Size of Queries on Relational Databases with non Uniform Distribution and Stochastic Dependence | 1989 | SIGMOD |
| 6 | 4,301 | Read-Once Functions and Query Evaluation in Probabilistic Databases | 2010 | VLDB |
| 7 | 8,745 | Querying Probabilistic Preferences in Databases | 2017 | PODS |
| 8 | 4,136 | Approximating Predicates and Expressive Queries on Probabilistic Databases | 2008 | PODS |
| 9 | 50 | Efficient Query Evaluation on Probabilistic Databases | 2004 | VLDB |
| 10 | 644 | The Complexity of Query Reliability | 1998 | PODS |