Buchdetails
Beschreibung
We present and analyze a strategy for processing joins on a highly parallel computer architecture. We model the architecture as consisting of n identical processor-memory clusters interconnected by a symmetric network onto which many processors may send at once. The strategy entails partitioning eadi relation horizontally based on a perfect hashing function applied to a key of the relation.