cs.cornell.edu

Adaptively parallelizing distributed range queries

Authors: 
Vigfusson, Ymir; Silberstein, Adam; Cooper, Brian F.; Fonseca, Rodrigo

We consider the problem of how to best parallelize range
queries in a massive scale distributed database. In tradi-
tional systems the focus has been on maximizing paral-
lelism, for example by laying out data to achieve the highest
throughput. However, in a massive scale database such as
our PNUTS system [11] or BigTable [10], maximizing par-
allelism is not necessarily the best strategy: the system has
more than enough servers to saturate a single client by re-
turning results faster than the client can consume them, and
when there are multiple concurrent queries, maximizing par-

Year: 
2009
Syndicate content