Database Paper Browser

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
1785
Venue
PODS
Year
2020
Pagerank
4.4188963e-05
Overall Rank
8,970 | 37.60%
DOI
10.1145/3375395.3387654

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 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