Consistent Query Answers in Inconsistent Databases
Summary: Defines consistent answers as query results invariant across all minimal repairs of an inconsistent relational database. Presents an iterative algorithm, with soundness/completeness for some constraint/query classes and termination proofs for several constraint types. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Marcelo Arenas
- 2. Leopoldo Bertossi
- 3. Jan Chomicki
Incoming Citations (Sorted by Pagerank)
Showing 4 of 104 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,325 | A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys | 2022 | PODS | 4.1945683e-05 |
| 11,456 | Temporal Dependencies for Graphs | 2021 | SIGMOD | 4.1945683e-05 |
| 12,012 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB | 4.1945683e-05 |
| 12,478 | Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing | 2007 | VLDB | 4.1945683e-05 |
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