DBScholar

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
2013
Venue
PODS
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,650 | 26.94%
DOI
10.1145/3725247

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{kolaitis_pods25,
        address = {New York, NY, USA},
        series = {{PODS} '25},
        title = {{Rewriting Consistent Answers on Annotated Data}},
        url = {https://dl.acm.org/doi/10.1145/3725247},
        doi = {10.1145/3725247},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kolaitis, Phokion and Pardal, Nina and Virtema, Jonni and Wijsen, Jef},
        year = {2025}
}

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 14 of 14 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