Back to papers
Rewriting Consistent Answers on Annotated Data
Summary: Semiring semantics with limited negation for annotated data; consistent answers are the minimum over repairs. Self-join free CQs with keys: CQA is rewritable iff the attack graph is acyclic; extends Koutris-Wijsen to semirings; bag semiring NP-hard and hard to approximate under strong cycles.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 1981
- Venue
- PODS
- Year
- 2025
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,357 | 27.95%
- DOI
-
10.1145/3725247
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 31 |
Provenance Semirings |
2007 |
PODS |
0.0007857786 |
| 49 |
Consistent Query Answers in Inconsistent Databases |
1999 |
PODS |
0.00067660624 |
| 2,243 |
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints |
2015 |
PODS |
9.2166927e-05 |
| 2,907 |
Convergence of Datalog over (Pre-) Semirings |
2022 |
PODS |
7.933806e-05 |
| 5,992 |
Evaluating Datalog over Semirings: A Grounding-based Approach |
2024 |
PODS |
5.2415551e-05 |
| 6,112 |
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join |
2024 |
PODS |
5.2048658e-05 |
| 6,274 |
Classification of Annotation Semirings over Query Containment |
2012 |
PODS |
5.1321227e-05 |
| 7,063 |
On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases |
2010 |
PODS |
4.8461152e-05 |
| 7,069 |
Consistent Query Answering for Primary Keys on Path Queries |
2021 |
PODS |
4.8438319e-05 |
| 8,970 |
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys |
2020 |
PODS |
4.4188963e-05 |
| 10,899 |
Consistent Query Answering for Primary Keys on Rooted Tree Queries |
2024 |
PODS |
4.1945683e-05 |
| 10,915 |
Consistency of Relations over Monoids |
2024 |
PODS |
4.1945683e-05 |
| 10,928 |
Computing Range Consistent Answers to Aggregation Queries via Rewriting |
2024 |
PODS |
4.1945683e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 6,948 |
Semantic Acyclicity on Graph Databases |
2013 |
PODS |
4.8898337e-05 |
| 11,325 |
A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys |
2022 |
PODS |
4.1945683e-05 |
| 7,063 |
On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases |
2010 |
PODS |
4.8461152e-05 |
| 3,681 |
Queries with Incomplete Answers over Semistructured Data |
1999 |
PODS |
6.8492288e-05 |
| 12,012 |
Certain Query Answering in Partially Consistent Databases |
2014 |
VLDB |
4.1945683e-05 |
| 7,069 |
Consistent Query Answering for Primary Keys on Path Queries |
2021 |
PODS |
4.8438319e-05 |
| 10,899 |
Consistent Query Answering for Primary Keys on Rooted Tree Queries |
2024 |
PODS |
4.1945683e-05 |
| 2,243 |
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints |
2015 |
PODS |
9.2166927e-05 |
| 8,410 |
Charting the Tractability Frontier of Certain Conjunctive Query Answering |
2013 |
PODS |
4.5204725e-05 |
| 8,970 |
First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys |
2020 |
PODS |
4.4188963e-05 |