The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
Databases
2015-12-08 v2
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.
Keywords
Cite
@article{arxiv.1501.01817,
title = {The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable},
author = {Tomasz Gogacz and Jerzy Marcinkowski},
journal= {arXiv preprint arXiv:1501.01817},
year = {2015}
}