A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs

12 Jan 2020 Amarilli Antoine Ceylan İsmail İlkan

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^\infty... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DATABASES
  • COMPUTATIONAL COMPLEXITY
  • DATA STRUCTURES AND ALGORITHMS