Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable.
Summary: Proves that conjunctive-query finite determinacy is undecidable, settling a long-standing open problem by extending the Red Spider technique to the finite-instance setting. Builds a concrete Q0 and Q showing finite (but not unrestricted) determinacy and proves no FO-rewriting exists for Q0. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,898 | Disclosure-Compliant Query Answering | 2024 | SIGMOD | 4.8925595e-05 |
| 11,558 | On Monotonic Determinacy and Rewritability For Recursive Queries and Views | 2020 | PODS | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 144 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041462501 |
| 416 | Computing Queries from Derived Relations | 1985 | VLDB | 0.0002380776 |
| 2,401 | Physical Data Independence, Constraints, and Optimization with Universal Plans | 1999 | VLDB | 8.8954126e-05 |
| 3,324 | On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information | 2006 | PODS | 7.2213002e-05 |
Previous
Page 1 / 1
Next