64 citations · 545 across the 60 of their papers we have counts for
4 papers · 2 filters
Answering Conjunctive Queries with Inequalities
Paraschos Koutris, Tova Milo, Sudeepa Roy +1
In this paper, we study the complexity of answering conjunctive queries (CQ) with inequalities). In particular, we are interested in comparing the complexity of the query with and…
Approximate Lifted Inference with Probabilistic Databases
Wolfgang Gatterbauer, Dan Suciu
This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic databases. In our approach, every query is evaluated entirely in the database en…
Symmetric Weighted First-Order Model Counting
Paul Beame, Guy Van den Broeck, Eric Gribkoff +1
The FO Model Counting problem (FOMC) is the following: given a sentence in FO and a number , compute the number of models of over a domain of size ; the Weighted vari…
Skew in Parallel Query Processing
Paul Beame, Paraschos Koutris, Dan Suciu
We study the problem of computing a conjunctive query q in parallel, using p of servers, on a large database. We consider algorithms with one round of communication, and study the…