Database Paper Browser

Back to papers

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)

Paper ID
1057
Venue
PODS
Year
1995
Pagerank
0.00016050985
Overall Rank
841 | 94.16%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
571 The Complexity of Query Reliability 1998 PODS 0.00019910719
627 Management of Probabilistic Data: Foundations and Challenges 2007 PODS 0.00018959005
3,589 On the Complexity of Managing Probabilistic XML Data 2007 PODS 6.9427709e-05
4,442 Approximating Predicates and Expressive Queries on Probabilistic Databases 2008 PODS 6.186154e-05
5,537 Cleaning Uncertain Data with Quality Guarantees 2008 VLDB 5.4522327e-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