Database Paper Browser

Back to papers

Certain Query Answering in Partially Consistent Databases

Summary: Uncertain databases with dependencies: CERTAINTY(q, Sigma) asks if every repair satisfies an acyclic, self-join-free CQ q under Sigma (FDs + a restricted join dependency). An algorithm decides whether CERTAINTY(q, Sigma) is first-order expressible and, if possible, outputs its FO definition. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10913
Venue
VLDB
Year
2014
Pagerank
4.1945683e-05
Overall Rank
12,012 | 16.44%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers