The complexity of weighted counting for acyclic conjunctive queries
We study weighted counting of solutions of acyclic conjunctive queries. We chart the tractability frontier for this problem. A parameter, called quantified star size, that measures how projected variables are spread in the query. Having bounded quantified star size exactly characterizes tractability for this problem.
conjunctive queries counting complexity