Data Management

Flexible Partitioning for Selective Binary Theta-Joins in a Massively Parallel Setting
Efficient join processing plays an important role in big data analysis. In this work, we focus on generic theta joins in a massively parallel environment, such as MapReduce and Spark.
Ioannis Koumarelas, Athanasios Naskos, Anastasios Gounaris
PDF Cite Code
Flexible Partitioning for Selective Binary Theta-Joins in a Massively Parallel Setting
Binary Theta-Joins using MapReduce: Efficiency Analysis and Improvements
We deal with binary theta-joins in a MapReduce environment, and we make two contributions. First, we show that the best known algorithm …
Ioannis Koumarelas, Athanasios Naskos, Anastasios Gounaris
PDF Cite Code
Binary Theta-Joins using MapReduce: Efficiency Analysis and Improvements