A distributed join algorithm for the grid file in the hypercube multicomputer system /
Abstract: "This paper presents a parallel join algorithm for the grid file on the shared-nothing, hypercube multicomputer system. We first suggest a method for distributing buckets of a grid file into a hypercube multicomputer. It is called recursively halving assignment by which balanced dis...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
College Station, Tex. :
Texas A & M University, Computer Science Dept.,
[1993]
|
| Series: | Technical report (Texas A & M University. Computer Science Department) ;
93-042. |
| Subjects: |
| Summary: | Abstract: "This paper presents a parallel join algorithm for the grid file on the shared-nothing, hypercube multicomputer system. We first suggest a method for distributing buckets of a grid file into a hypercube multicomputer. It is called recursively halving assignment by which balanced distribution of buckets is guaranteed. We then propose a fully distributed algorithm to be used for joining two grid files. Unlike an existing centralized algorithm, a coordinator is not necessary in our approach, which collects and broadcasts records of a group. Instead, every node participates in exchanging records of a group with its related cube neighbors in a fully distributed manner. In this way, scalability can be achieved with a large number of processing nodes. Performance analysis shows us that our algorithm outperforms the centralized one due to low communication overhead." |
|---|---|
| Item Description: | Cover title. |
| Physical Description: | 25 leaves : illustrations ; 28 cm. |
| Bibliography: | Includes bibliographical references. |