Database Paper Browser

Back to papers

Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability

Summary: Quantified-star-size with hypertree decompositions characterizes tractable counting only for bounded-arity simple CQs; in general it is insufficient. Introduce #-generalized hypertree decompositions yielding FPT preprocessing + polynomial-time counting for bounded #-ghw, and a hybrid method that leverages database constraints (keys/FDs) to expand tractable classes. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1635
Venue
PODS
Year
2014
Pagerank
9.6447857e-05
Overall Rank
2,063 | 85.65%
DOI
10.1145/2594538.2594559

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

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.

Previous Page 1 / 1 Next

Semantically Similar Papers