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)
Incoming Non-self Citations Over Time
Authors
- 1. Isolde Adler
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,322 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012595941 |
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 |
|---|---|---|---|---|
| 623 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00018976192 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,603 | Polynomial-time program transformations in deductive databases | 1990 | PODS | 4.6959912e-05 |
| 7,289 | On Tree-Based Techniques for Query Evaluation | 1992 | PODS | 4.7692311e-05 |
| 10,372 | Soft and Constrained Hypertree Width | 2025 | PODS | 4.1905499e-05 |
| 8,850 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 4.4324268e-05 |
| 4,055 | On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates | 1998 | PODS | 6.4906839e-05 |
| 1,039 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 0.00014488271 |
| 142 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00041780711 |
| 9,739 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 4.2895392e-05 |
| 912 | The Complexity of Evaluating Relational Queries | 1983 | PODS | 0.00015374685 |
| 2,804 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.1039107e-05 |