An efficient skew-insensitive algorithm for join processing on grid architectures

  • Authors:
  • Mohamad Al Hajj Hassan;Mostafa Bamha;Frédéric Loulergue

  • Affiliations:
  • EXQIM, Paris, France;LIFO, University of Orléans, Orléans, France;LIFO, University of Orléans, Orléans, France

  • Venue:
  • Proceedings of the fifth international workshop on High-level parallel programming and applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Scientific experiments in many domains generate a huge amount of data whose size is in the range of hundreds of megabytes to petabytes. These data are stored on geographically distributed and heterogeneous resources. Researchers who need to analyze and have a fast access to such data are also located all over the globe. Queries executed by these researchers may require the transfer of huge amount of data over the wide area network in a reasonable time. Due to these emerging needs, the grid infrastructure was born. In this paper, we are interested in treating join queries on the grid. We propose a new parallel algorithm allowing to reduce communication and disk Input/Output costs to minimum. This algorithm guarantees a balanced load among all processing nodes in each cluster and then among all the clusters of a grid architecture.