A dichotomy for homomorphism−closed queries on probabilistic graphs
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 queri...
| Autori principali: | , |
|---|---|
| Natura: | Conference item |
| Lingua: | English |
| Pubblicazione: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2020
|