Communication steps for parallel query processing
J. ACM, Volume 64, Issue 6, 2017, Pages 40:1-40:58.
parallel query processingspecific classlarge number plarge input databasearbitrary bitMore(7+)
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 each server can receive only O(n/p1-ε) bits of data, where ε ∈[0,1] is a parameter that controls replication. We examine how many global communication steps are neede...More
PPT (Upload PPT)