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)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Sergio Greco
- 2. Fabian Pijcke
- 3. Jef Wijsen
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 49 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00067660624 |
| 265 | A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification | 2005 | SIGMOD | 0.00029763412 |
| 678 | ConQuer: Efficient Management of Inconsistent Databases | 2005 | SIGMOD | 0.00018253213 |
| 3,524 | Efficient Querying of Inconsistent Databases with Binary Integer Programming | 2013 | VLDB | 7.0087032e-05 |
| 7,063 | On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases | 2010 | PODS | 4.8461152e-05 |
| 8,410 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS | 4.5204725e-05 |
Previous
Page 1 / 1
Next