Conjunctive Queries on Probabilistic Graphs: Combined Complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Conjunctive Queries on Probabilistic Graphs: Combined Complexity


Query evaluation over probabilistic databases is known to be intractable in many cases, even in data complexity, i.e., when the query is fixed. Although some restrictions of the queries [20] and instances [4] have been proposed to lower the complexity, these known tractable cases usually do not apply to combined complexity, i.e., when the query is not fixed. This leaves open the question of which query and instance languages ensure the tractability of probabilistic query evaluation in combined complexity. This paper proposes the first general study of the combined complexity of conjunctive query evaluation on probabilistic instances over binary signatures, which we can alternatively phrase as a probabilistic version of the graph homomor-phism problem, or of a constraint satisfaction problem (CSP) variant. We study the complexity of this problem depending on whether instances and queries can use features such as edge labels, disconnectedness, branching, and edges in both directions. We show that the complexity landscape is surprisingly rich, using a variety of technical tools: automata-based compilation to d-DNNF lineages as in [4], β-acyclic lin-eages using [11], the X-property for tractable CSP from [25], graded DAGs [28] and various coding techniques for hardness proofs.
Fichier principal
Vignette du fichier
main.pdf (492.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01486634 , version 1 (10-03-2017)



Antoine Amarilli, Mikaël Monet, Pierre Senellart. Conjunctive Queries on Probabilistic Graphs: Combined Complexity. Principles of Database Systems (PODS), May 2017, Chicago, United States. ⟨10.1145/3034786.3056121⟩. ⟨hal-01486634⟩
245 View
67 Download



Gmail Facebook X LinkedIn More