The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
Not on the map. Why?
Abstract (arXiv)
We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecidable.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 8 Jan 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.