35 citations · 160 across the 33 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DB2014
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…
cs.DB2014★ 11 cited
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…