Oliver Kennedy'Grats Dr. Huber!
Aaron's #Thesis work demonstrated that queries evaluated on a probabilistic database have, in general, a higher fine grained complexity than when the same query is evaluated on the analogous deterministic database... and that's still the case under bag semantics.
One thing led to another, and it all ended in a mashup of Wander Join and the GProm Provenance system that can (approximately) answer probabilistic queries *faster* than a deterministic database can (exactly) answer the same query.
