Skew in parallel query processing
PODS, pp. 212-223, 2014.
lower boundsparallel computationparallel databasesskew
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 complexity of the communication. We are especially interested in the case where the data is skewed, which is a major challenge for scalable parallel query proce...More
Full Text (Upload PDF)