291 citations · 445 across the 25 of their papers we have counts for
Showing 2013 · cs.DBShow all
3 papers · 2 filters
cs.DB2013★ 6 cited
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…
cs.DB2013★ 21 cited
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,…
cs.DB2013★ 35 cited
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…