2000 character limit reached
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
Published 8 Jan 2015 in cs.DB | (1501.01817v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.