Prefer a chat interface with context about you and your work?
The Complexity of Conjunctive Queries with Degree 2
It is well known that the tractability of conjunctive query answering can be characterised in terms of treewidth when the problem is restricted to queries of bounded arity. We show that a similar characterisation also exists for classes of queries with unbounded arity and degree 2. To do so we …