Database Paper Browser

Back to papers

On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information

Summary: Characterizes decidability/undecidability and the finite-controllability frontier for OWA query answering with functional (keys) and inclusion dependencies across CQs/UCQs (±negation, inequality), comparing finite vs unrestricted DB semantics. Derives consequences for IC implication and query containment, notably proving finite controllability of CQ containment under arbitrary inclusion dependencies and under key/foreign-key dependencies, resolving two long-standing open problems. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1409
Venue
PODS
Year
2006
Pagerank
7.2213002e-05
Overall Rank
3,324 | 76.88%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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