On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases
Summary: Characterize when CERTAINTY(q) is FO-expressible for Boolean conjunctive queries over key-violating (uncertain) databases, giving a necessary syntactic condition for queries without self‑join. For acyclic CQs the condition is also sufficient, yielding a decision procedure and a constructive FO‑rewriting (hence AC0). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jef Wijsen (University of Mons)
BibTeX Citation
@inproceedings{wijsen_pods10,
address = {New York, NY, USA},
series = {{PODS} '10},
title = {{On the First-order Expressibility of Computing Certain Answers to Conjunctive Queries over Uncertain Databases}},
url = {https://dl.acm.org/doi/10.1145/1807085.1807111},
doi = {10.1145/1807085.1807111},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Wijsen, Jef},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 33 | Consistent Query Answers in Inconsistent Databases | 1999 | PODS | 0.00049907763 |
| 586 | ConQuer: Efficient Management of Inconsistent Databases | 2005 | SIGMOD | 0.00016124396 |
| 2,775 | MayBMS: A Probabilistic Database Management System | 2009 | SIGMOD | 8.1359291e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,558 | Consistent Query Answering for Primary Keys on Path Queries | 2021 | PODS |
| 2 | 11,524 | A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign Keys | 2022 | PODS |
| 3 | 10,650 | Rewriting Consistent Answers on Annotated Data | 2025 | PODS |
| 4 | 5,245 | Certain Answers Meet Zero-One Laws | 2018 | PODS |
| 5 | 9,133 | First-Order Rewritability in Consistent Query Answering with Respect to Multiple Keys | 2020 | PODS |
| 6 | 11,121 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 7 | 5,773 | Consistent Query Answering for Primary Keys and Conjunctive Queries with Negated Atoms | 2018 | PODS |
| 8 | 1,707 | The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints | 2015 | PODS |
| 9 | 8,626 | Charting the Tractability Frontier of Certain Conjunctive Query Answering | 2013 | PODS |
| 10 | 12,210 | Certain Query Answering in Partially Consistent Databases | 2014 | VLDB |