License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICDT.2020.5
URN: urn:nbn:de:0030-drops-119295
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11929/
Go to the corresponding LIPIcs Volume Portal

Amarilli, Antoine ; Ceylan, İsmail İlkan

A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs

pdf-format:
LIPIcs-ICDT-2020-5.pdf (0.6 MB)

Abstract

We study the problem of probabilistic query evaluation (PQE) over probabilistic graphs, namely, tuple-independent probabilistic databases (TIDs) on signatures of arity two. Our focus is the class of queries that is closed under homomorphisms, or equivalently, the infinite unions of conjunctive queries, denoted UCQ∞. Our main result states that all unbounded queries in UCQ∞ are #P-hard for PQE. As bounded queries in UCQ∞ are already classified by the dichotomy of Dalvi and Suciu [Dalvi and Suciu, 2012], our results and theirs imply a complete dichotomy on PQE for UCQ∞ queries over probabilistic graphs. This dichotomy covers in particular all fragments in UCQ∞ such as negation-free (disjunctive) Datalog, regular path queries, and a large class of ontology-mediated queries on arity-two signatures. Our result is shown by reducing from counting the valuations of positive partitioned 2-DNF formulae (#PP2DNF) for some queries, or from the source-to-target reliability problem in an undirected graph (#U-ST-CON) for other queries, depending on properties of minimal models.

BibTeX - Entry

@InProceedings{amarilli_et_al:LIPIcs:2020:11929,
  author =	{Antoine Amarilli and İsmail İlkan Ceylan},
  title =	{{A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs}},
  booktitle =	{23rd International Conference on Database Theory (ICDT 2020)},
  pages =	{5:1--5:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-139-9},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{155},
  editor =	{Carsten Lutz and Jean Christoph Jung},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/11929},
  URN =		{urn:nbn:de:0030-drops-119295},
  doi =		{10.4230/LIPIcs.ICDT.2020.5},
  annote =	{Keywords: Tuple-independent database, #P-hardness, recursive queries, homomorphism-closed queries}
}

Keywords: Tuple-independent database, #P-hardness, recursive queries, homomorphism-closed queries
Collection: 23rd International Conference on Database Theory (ICDT 2020)
Issue Date: 2020
Date of publication: 11.03.2020
Supplementary Material: Video of the Presentation: https://doi.org/10.5446/46843

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI