Theory of Computing Systems

, Volume 57, Issue 4, pp 1202–1249

Structural Tractability of Counting of Solutions to Conjunctive Queries

Article

DOI: 10.1007/s00224-014-9543-y

Cite this article as:
Durand, A. & Mengel, S. Theory Comput Syst (2015) 57: 1202. doi:10.1007/s00224-014-9543-y
  • 77 Downloads

Abstract

We explore the complexity of counting solutions to conjunctive queries, a basic class of queries from database theory. We introduce a parameter, called the quantified star size of a query ϕ, which measures how the free variables are spread in ϕ. As usual in database theory, we associate a hypergraph to a query ϕ. We show that for classes of queries for which these associated hypergraphs admit good decompositions, e.g., bounded width generalized hypertree decompositions, bounded quantified star size exactly characterizes the subclasses of hypergraphs for which counting the number of solutions is tractable. In the case of bounded arity, this allows us to fully characterize the classes of hypergraphs for which counting the solutions is tractable. Finally, we also analyze the complexity of computing the quantified star size of a conjunctive query.

Keywords

Conjunctive queries Counting complexity Hypergraph decomposition techniques 

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Université Paris DiderotInstitut de Mathématiques de JussieuParisFrance
  2. 2.Department of MathematicsTechnische Universität BerlinBerlinGermany