64 citations · 67 across the 3 of their papers we have counts for
1 paper · 2 filters
Nilesh Dalvi, Dan Suciu
We show that for every conjunctive query, the complexity of evaluating it on a probabilistic database is either \PTIME or #¶-complete, and we give an algorithm for deciding whether…