The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
arXiv:1501.01817 · doi:10.1109/LICS.2015.35
Abstract
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.