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
- 1. Gianluigi Greco (University of Calabria)
- 2. Francesco Scarcello (University of Calabria)
BibTeX Citation
@inproceedings{greco_pods10,
address = {New York, NY, USA},
series = {{PODS} '10},
title = {{The Power of Tree Projections: Local Consistency, Greedy Algorithms, and Larger Islands of Tractability}},
url = {https://dl.acm.org/doi/10.1145/1807085.1807127},
doi = {10.1145/1807085.1807127},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Greco, Gianluigi and Scarcello, Francesco},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 819 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.00013660715 |
| 2,482 | Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability | 2014 | PODS | 8.3992826e-05 |
| 3,636 | Static Analysis and Optimization of Semantic Web Queries | 2012 | PODS | 7.1450443e-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 |
|---|---|---|---|---|
| 136 | Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (Extended Abstract) | 1982 | PODS | 0.0002972645 |
| 684 | Generalized Hypertree Decompositions: NP-Hardness and Tractable Variants | 2007 | PODS | 0.00014791388 |
| 1,690 | Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width | 2001 | PODS | 9.8565419e-05 |
| 3,503 | On the Decidability and Finite Controllability of Query Processing in Databases with Incomplete Information | 2006 | PODS | 7.2485903e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 7,143 | Tree-Width and Functional Dependencies in Databases | 2008 | PODS |
| 2 | 9,177 | Efficient Approximations of Conjunctive Queries | 2012 | PODS |
| 3 | 11,662 | A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition | 2024 | VLDB |
| 4 | 11,475 | Consistent Query Answering for Primary Keys on Rooted Tree Queries | 2024 | PODS |
| 5 | 2,366 | Hypertree Decompositions and Tractable Queries | 1999 | PODS |
| 6 | 10,059 | Tractable Database Design through Bounded Treewidth | 2006 | PODS |
| 7 | 7,801 | Tractable Lineages on Treelike Instances: Limits and Extensions | 2016 | PODS |
| 8 | 8,478 | The Equivalence of Solving Queries and Producing Tree Projections (Extended Abstract) | 1986 | PODS |
| 9 | 819 | Hypertree Decompositions: Questions and Answers | 2016 | PODS |
| 10 | 2,728 | Weighted Hypertree Decompositions and Optimal Query Plans | 2004 | PODS |