The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability
Summary: Precisely characterizes when local consistency yields global consistency via tree projections: existence of tree projections for certain subqueries is necessary and sufficient, covering both decision and projected-answer tasks. Proposes greedy tree projections and identifies new recognizable islands of tractability and quasi-tractability. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,151 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012031066 |
| 2,488 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS | 8.5857013e-05 |
| 4,311 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 6.8385016e-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 |
|---|---|---|---|---|
| 145 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.00029697141 |
| 903 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00013361264 |
| 1,903 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 9.6057653e-05 |
| 3,393 | On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information | 2006 | PODS | 7.5208389e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,237 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS | 5.7193914e-05 |
| 8,883 | Efficient Approximations of Conjunctive Queries | 2012 | PODS | 5.4156287e-05 |
| 11,135 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB | 5.1725247e-05 |
| 10,903 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS | 5.1725247e-05 |
| 2,471 | Hypertree Decompositions and Tractable Queries | 1999 | PODS | 8.6104977e-05 |
| 9,748 | Tractable Database Design through Bounded Treewidth | 2006 | PODS | 5.2795863e-05 |
| 7,505 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS | 5.6636469e-05 |
| 8,168 | The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) | 1986 | PODS | 5.5419908e-05 |
| 1,151 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00012031066 |
| 2,886 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS | 8.0645443e-05 |