An Efficient Parallel Join Algorithm Based on Hypercube-Partitioning

Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk I/O and CPU costs. The communication cost, however, is also an important factor that can significantly affect the join processing performance in multiprocessor systems. In this paper we propose an efficient parallel join algorithm, aclled Cube-Robust, for hypercube multicomputers. The proposed algorithm is developed based on the observation that the size ratio of two relations to be joined is the dominant factor in the communication cost. We develop the analytic cost model for the proposed join algorithm. The performance comparisons show that the Cube-Robust join algorithm works better than others proposed earlier in a wide range of size ratios.
Publisher
IEEE
Issue Date
1994-09
Citation

Third Int'l Conf. on Parallel and Distributed Information Systems, Austin, Serial. 3, USA, p.50-57

ISBN
0-8186-6401-0
URI
http://hdl.handle.net/10203/830
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
An Efficient Parallel Join Algorithm Based on Hypercube-Partitioning.pdf(723.41 kB)Download
  • Hit : 640
  • Download : 252
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0