The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
classification
💻 cs.DB
keywords
conjunctivedeterminacyproblemqueryundecidabledatabaseshuntknown
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.