tokens: If the dominating star size of a conjunctive query is large , then we show that counting solution tuples to the query is at least as hard as counting dominating sets , which yields a fine - grained complexity lower bound under the Strong Exponential Time Hypothesis ( SETH ) as well as a -hardness result in parameterized complexity .