A Theoretical and Experimental Comparison of Filter-Based Equijoins in MapReduce - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2016

A Theoretical and Experimental Comparison of Filter-Based Equijoins in MapReduce

Résumé

MapReduce has become an increasingly popular framework for large-scale data processing. However, complex operations such as joins are quite expensive and require sophisticated techniques. In this paper, we review state-of-the-art strategies for joining several relations in a MapReduce environment and study their extension with filter-based approaches. The general objective of filters is to eliminate non-matching data as early as possible in order to reduce the I/O, communication and CPU costs. We examine the impact of systematically adding filters as early as possible in MapReduce join algorithms, both analytically with cost models and practically with evaluations. The study covers binary joins, multi-way joins and recursive joins, and addresses the case of large inputs that gives rise to the most intricate challenges.
Fichier principal
Vignette du fichier
2016tldks.pdf (11.11 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01408492 , version 1 (09-12-2016)

Identifiants

Citer

Thuong-Cang Phan, Laurent d'Orazio, Philippe Rigaux. A Theoretical and Experimental Comparison of Filter-Based Equijoins in MapReduce. Transactions on Large-Scale Data- and Knowledge-Centered Systems XXV, 9620, Springer, pp.33-70, 2016, Lecture Notes in Computer Science, 978-3-662-49533-9. ⟨10.1007/978-3-662-49534-6_2⟩. ⟨hal-01408492⟩
45 Consultations
79 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More