| | |
Summary: Toward A Progress Indicator for Parallel Queries*
* University of Washington Technical Report UW TR: #UW-CSE-09-07-01
Kristi Morton, Abe Friesen, Magdalena Balazinska, Dan Grossman
Computer Science and Engineering Department, University of Washington
Seattle, Washington, USA
{kmorton,afriesen,magda,djg}@cs.washington.edu
Abstract-- In parallel query-processing environments, accu-
rate, time-oriented progress indicators could provide much utility
to users given that queries take a very long time to complete
and both inter- and intra-query execution times can have high
variance. In these systems, query times depend on the query
plans and the amount of data being processed, but also on the
amount of parallelism available, the types of operators (often
user-defined) that perform the processing, and the overall system
load. None of the techniques used by existing tools or available
in the literature provide a non-trivial progress indicator for
parallel queries. In this paper, we introduce Parallax, the first
such indicator. Several parallel data processing systems exist. In
this paper, we target environments where queries consist of a
series of MapReduce jobs. Parallax builds on recently-developed
|
