… We address the problem of choosing the partitioning attributes in a query tree to …
communication) costs. By regarding partitioning attributes as colors, we model it as a query tree …

… than communication) costs. By regarding partitioning attributes as colors, we model it as a
query tree coloring … Tree Annofafibn and Coloring optimization problems that are solved in this …

… Partitioned parallelism, however, suffers from higher communication … in parallel query
optimization (Section II). We then present our execution model for executing a multi-way join query …

… optimization of SQL queries for parallel machines. These consist of scheduling a tree of
interdependent communicating … -operator and intra-operator parallelism. We develop algorithms …

… order optimization in this paper, and assume that a two-phase approach to query optimization
is … Motwani, “Coloring away communication in parallel query optimization,” in VLDB, 1995. …

… In this figure, we also use categorical colors to help distinguish each line. Several routes …
This helps to avoid cluttered colors between nodes and also shows total values. Our system …

… parallel graph coloring heuristics with strong theoretical guarantees on work and depth and
coloring … This introduces a tunable amount of parallelism into the degeneracy ordering that is …

… [13] applied different randomized strategies to parallel query … in T,, which reduces the
communication and local cost in Tk. … b f a, is equivalent to the ball-coloring problem [24]. Note that …

… Pipelined parallelism permits all operators in such a tree to run concurrently. … a
parallelism-communication trade-off. A producer and a consumer operator must either communicate …

… communication over a network … query optimization and propose some directions of research.
We first provide a brief overview of parallel architectures (Section 2), and of parallel query …