Database Paper Browser

Back to papers

Semantic Acyclicity Under Constraints

Summary: Analyzes semantic acyclicity of conjunctive queries under dependencies, proving CQ‑containment decidability is not sufficient and that semantic acyclicity is undecidable for full tgds. Shows decidability (matching CQ‑containment complexity) for guarded, non‑recursive and sticky tgds; NP‑complete for egds with unary/binary keys; and gives tractable evaluation under guarded tgds and functional dependencies. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1697
Venue
PODS
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,829 | 17.71%
DOI
10.1145/2902251.2902302

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
1,328 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012565612
11,553 All-Instances Restricted Chase Termination 2020 PODS 4.1945683e-05
11,556 The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs 2020 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers