Performance comparison of join on hypercube and mesh

  • Authors:
  • Hyoung Jhang

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Kansas

  • Venue:
  • CSC '92 Proceedings of the 1992 ACM annual conference on Communications
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we compare the performance of two join algorithms on a cube and on a multidimensional mesh architectures. The algorithms are nested-loop and sort-merge joins. The study confirms that a higher connectivity architecture is faster and has a wider performance bandwidth. The sort-merge join algorithm is better for a small number of nodes, but it becomes worse than the nested-loop join algorithm as the number of nodes gets larger and the join selectivity gets large, especially for the simpler mesh architecture. The study also shows that the 3-dimensional mesh architecture has performance comparable to the more complicated cube architecture for the medium number of nodes in a system.