An improved selection-based parallel range-join algorithm in hypercubes

The range-join of two sets R and S is the set that contains all tuples (r, s) satisfying e/sub 1//spl les/|r-s|/spl les/e/sub 2/, r/spl isin/R and s/spl isin/S. For computing the range-join of R and S in a hypercube of p processors, this paper presents an improved selection-based parallel algorithm ... View More