Congratulations to Aaron on getting a straight up "Accept" on his SIGMOD paper on making #ProbabilisticDatabases Fast.

The paper proves that probabilistic queries (even on bags) are asymptotically slower than analogous deterministic queries, painstakingly builds up strategies for approximation, and finally shows that the resulting algorithm is, in effect, equivalent to the #WanderJoin #ApproximateQueryProcessing (#AQP) algorithm.