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: 1470
Venue: PODS
Year: 2008
Pagerank: 5.7228058e-05
Overall Rank: 7,029 | 51.78%
DOI: 10.1145/1376916.1376959

Incoming Non-self Citations Over Time

Authors

1. Isolde Adler (Humboldt University of Berlin)

BibTeX Citation

@inproceedings{adler_pods08,
        address = {New York, NY, USA},
        series = {{PODS} '08},
        title = {{Tree-Width and Functional Dependencies in Databases}},
        url = {https://dl.acm.org/doi/10.1145/1376916.1376959},
        doi = {10.1145/1376916.1376959},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Adler, Isolde},
        year = {2008}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
814	Hypertree Decompositions: Questions and Answers	2016	PODS	0.00013841737

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
673	Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants	2007	PODS	0.00015095061

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,886	Polynomial-time program transformations in deductive databases	1990	PODS
2	10,653	Soft and Constrained Hypertree Width	2025	PODS
3	8,035	On Tree-Based Techniques for Query Evaluation	1992	PODS
4	9,009	Efficient Approximations of Conjunctive Queries	2012	PODS
5	3,801	On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates	1998	PODS
6	2,678	Weighted Hypertree Decompositions and Optimal Query Plans	2004	PODS
7	134	Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract)	1982	PODS
8	9,864	Tractable Database Design through Bounded Treewidth	2006	PODS
9	1,467	The Complexity of Evaluating Relational Queries	1983	PODS
10	2,330	Hypertree Decompositions and Tractable Queries	1999	PODS