DBScholar

Back to papers

First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys

Summary: Extends consistent query answering under key dependencies to schemas allowing multiple keys per relation, focusing on self-join-free Boolean conjunctive queries. Proves decidability of FO-rewritability and provides an effective procedure to construct an FO rewriting when one exists. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1817
Venue
PODS
Year
2020
Pagerank
5.3169677e-05
Overall Rank
9,133 | 37.34%
DOI
10.1145/3375395.3387654

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{koutris_pods20,
        address = {New York, NY, USA},
        series = {{PODS} '20},
        title = {{First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys}},
        url = {https://dl.acm.org/doi/10.1145/3375395.3387654},
        doi = {10.1145/3375395.3387654},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Koutris, Paraschos and Wijsen, Jef},
        year = {2020}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

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