Database Paper Browser

Back to papers

Tree-Width and Functional Dependencies in Databases

Summary: Define closure tree-width and hyperclosure tree-width via a homomorphism reformulation of conjunctive query evaluation under functional dependencies; bounded (hyper)closure tree-width makes HOM/CQ tractable. Prove separations from (hyper)tree-width, NP-completeness of recognition for fixed k≥3, and a polynomial-time approximation for k-bounded closure tree-width. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1471
Venue
PODS
Year
2008
Pagerank
4.8898337e-05
Overall Rank
6,949 | 51.66%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,328 Hypertree Decompositions: Questions and Answers 2016 PODS 0.00012565612
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

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

Rank Cited Paper Year Venue Pagerank
626 Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants 2007 PODS 0.00018973823
Previous Page 1 / 1 Next

Semantically Similar Papers