The mutual range-join of k sets, S1, S2, ? ? ?, Sk, is the set containing all
tuples (s1; s2; ? ? ? ; sk) that satisfy e1 <= jsi ?sj j <= e2 for all 1 <= i <> j <= k, where
si 2 Si and e1 <= e2 are fixed constants. This paper presents an efficient parallel
algorithm for computing the k-set mutual range-join in hypercube computers.
The proposed algorithm uses a fast method to determine whether the differences
of all pair numbers among k given numbers are within a given range and applies
the technique of permutation-based range-join [11]. To compute the mutual