Chapter 18 Parallel Databases.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Parallel Nested-Loop Join Assume that relation s is much smaller than relation r and that r is stored by partitioning. there is an index on a join attribute of relation r at each of the partitions of relation r. Use asymmetric fragment-and-replicate, with relation s being replicated, and using the existing partitioning of relation r. Each processor Pj where a partition of relation s is stored reads the tuples of relation s stored in Dj, and replicates the tuples to every other processor Pi. At the end of this phase, relation s is replicated at all sites that store tuples of relation r. Each processor Pi performs an indexed nested-loop join of relation s with the ith partition of relation r. Other Relational Operations Selection ??(r) If ? is of the form ai = v, where ai is an attribute and v a value. If r is partitioned on ai the selection is performed at a single processor. If ? is of the form l = ai = u (i.e., ? is a range selection) and the relation has been range-partitioned on ai Selection is performed at each processor whose partition overlaps with the specified range of values. In all other cases: the selection is performed in parallel at all the processors. Other Relational Operations (Cont.) Duplicate elimination Perform by using either of the parallel sort techniques eliminate duplicates as soon as they are found during sorting. Can also partition the tuples (using either range- or hash- partitioning) and perform duplicate elimination locally at each processor. Projection Projection without duplicate elimination can be performed as tuples are read in from disk in parallel. If duplicate elimination is required, any of the above duplicate elimination techniques can be used. Grouping/Aggregation Partition the relation on the grouping attributes and then compute the aggregate values locally at each processor. Can reduce cost of transferring tuples during partitioning by partly computing aggr