Database Paper Browser

Back to papers

On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases

Summary: Characterize when CERTAINTY(q) is FO-expressible for Boolean conjunctive queries over key-violating (uncertain) databases, giving a necessary syntactic condition for queries without self‑join. For acyclic CQs the condition is also sufficient, yielding a decision procedure and a constructive FO‑rewriting (hence AC0). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1518
Venue
PODS
Year
2010
Pagerank
4.8461152e-05
Overall Rank
7,063 | 50.87%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
49 Consistent Query Answers in Inconsistent Databases 1999 PODS 0.00067660624
678 ConQuer: Efficient Management of Inconsistent Databases 2005 SIGMOD 0.00018253213
2,875 MayBMS: A Probabilistic Database Management System 2009 SIGMOD 7.9742313e-05
Previous Page 1 / 1 Next

Semantically Similar Papers