Algorithm 8.1: Parallel Nested Loop (PNL) Input: R₁, R₂, ..., Rm: fragments of relation R S1, S2,..., Sn: fragments of relation S; JP: join predicate Output: T1, T2,..., Tn: result fragments begin end for i from 1 to m in parallel do | send R; to each node containing a fragment of S end for for j from 1 to n in parallel do R←UR₁; i=1 TjRAJP Sj end for {send R entirely to each S-node} {perform the join at each S-node} {R; from R-nodes; R is fully replicated at S-nodes}
Algorithm 8.1: Parallel Nested Loop (PNL) Input: R₁, R₂, ..., Rm: fragments of relation R S1, S2,..., Sn: fragments of relation S; JP: join predicate Output: T1, T2,..., Tn: result fragments begin end for i from 1 to m in parallel do | send R; to each node containing a fragment of S end for for j from 1 to n in parallel do R←UR₁; i=1 TjRAJP Sj end for {send R entirely to each S-node} {perform the join at each S-node} {R; from R-nodes; R is fully replicated at S-nodes}
Chapter3: Data Representation
Section: Chapter Questions
Problem 1PE
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning