Communication Steps for Parallel Query Processing

Paul Beame, Paraschos Koutris, Dan Suciu

We consider the problem of computing a relational query $q$ on a large input database of size $n$, using a large number $p$ of servers. The computation is performed in rounds, and…