Database Paper Browser

Back to papers

Size and Treewidth Bounds for Conjunctive Queries

Summary: Introduce a novel query-variable “coloring number” C(Q) giving tight worst-case bounds on result size |Q(D)| for conjunctive queries both without and with simple (one-attribute) keys, generalizing Atserias–Grohe–Marx AGM-style bounds. Extend the coloring to obtain lower bounds under arbitrary functional dependencies and exactly characterize which queries preserve output treewidth and input sparsity (with or without keys). (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1476
Venue
PODS
Year
2009
Pagerank
5.3441438e-05
Overall Rank
5,744 | 60.05%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
502 Worst-case Optimal Join Algorithms 2012 PODS 0.00021526612
4,546 Bounded Conjunctive Queries 2014 VLDB 6.0987778e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

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

Rank Cited Paper Year Venue Pagerank
38 Testing Implications Of Data Dependencies 1979 SIGMOD 0.00075110004
48 Data Integration: A Theoretical Perspective 2002 PODS 0.00069720859
82 Answering Queries Using Views (Extended Abstract) 1995 PODS 0.00054402763
454 An Overview of Query Optimization in Relational Systems 1998 PODS 0.00022734812
621 Schema Mappings, Data Exchange, and Metadata Management 2005 PODS 0.00019005115
Previous Page 1 / 1 Next

Semantically Similar Papers