64 citations · 545 across the 60 of their papers we have counts for
4 papers · 2 filters
Model Counting of Query Expressions: Limitations of Propositional Methods
Paul Beame, Jerry Li, Sudeepa Roy +1
Query evaluation in tuple-independent probabilistic databases is the problem of computing the probability of an answer to a query given independent probabilities of the individual…
Dissociation and Propagation for Approximate Lifted Inference with Standard Relational Database Management Systems
Wolfgang Gatterbauer, Dan Suciu
Probabilistic inference over large data sets is a challenging data management problem since exact inference is generally #P-hard and is most often solved approximately with samplin…
Lower Bounds for Exact Model Counting and Applications in Probabilistic Databases
Paul Beame, Jerry Li, Sudeepa Roy +1
The best current methods for exactly computing the number of satisfying assignments, or the satisfying probability, of Boolean formulas can be seen, either directly or indirectly,…
Communication Steps for Parallel Query Processing
Paul Beame, Paraschos Koutris, Dan Suciu
We consider the problem of computing a relational query on a large input database of size , using a large number of servers. The computation is performed in rounds, and…