Approximating Queries on Probabilistic Graphs

Antoine Amarilli, Timothy van Bremen, Octave Gaspard +1

Query evaluation over probabilistic databases is notoriously intractable -- not only in combined complexity, but often in data complexity as well. This motivates the study of appro…