An efficient equi-semi-join algorithm for distributed architectures - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

An efficient equi-semi-join algorithm for distributed architectures

Résumé

Semi-joins is the most used technique to optimize the treatment of complex relational queries on distributed architectures. However the overcost related to semi-joins computation can be very high due to data skew and to the high cost of communication in distributed architectures. In this paper we present a parallel equi-semi-join algorithm for shared nothing machines. The performance of this algorithm is analyzed using the BSP cost model and is proved to have asymptotic optimal complexity and perfect load balancing even for highly skewed data. This guarantees unlimited scalability in all situations for this key algorithm.

Domaines

Informatique
Fichier non déposé

Dates et versions

hal-00081352 , version 1 (22-06-2006)

Identifiants

  • HAL Id : hal-00081352 , version 1

Citer

Mostafa Bamha, Gaetan Hains. An efficient equi-semi-join algorithm for distributed architectures. 2005, p. 755-763. ⟨hal-00081352⟩
59 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More