首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs
  • 本地全文:下载
  • 作者:Antoine Amarilli ; Ä°smail Ä°lkan Ceylan
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2020
  • 卷号:155
  • 页码:5:1-5:20
  • DOI:10.4230/LIPIcs.ICDT.2020.5
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要: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â^Z. Our main result states that all unbounded queries in UCQâ^Z are #P-hard for PQE. As bounded queries in UCQâ^Z 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â^Z queries over probabilistic graphs. This dichotomy covers in particular all fragments in UCQâ^Z 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.
  • 关键词:Tuple-independent database; #P-hardness; recursive queries; homomorphism-closed queries
国家哲学社会科学文献中心版权所有