Binary Theta-Joins using MapReduce: Efficiency Analysis and Improvements
| Title: | Binary Theta-Joins using MapReduce: Efficiency Analysis and Improvements |
|---|---|
| Authors: | Ioannis K. Koumarelas; Athanasios Naskos; Anastasios Gounaris |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Source: | http://ceur-ws.org/Vol-1133/paper-02.pdf. |
| Collection: | CiteSeerX |
| Description: | We deal with binary theta-joins in a MapReduce environment, and we make two contributions. First, we show that the best known algorithm to date for this problem can reach the optimal trade-o ↵ between the size of the input a reducer can receive and the incurred communication cost when the join selectivity is high. Second, when the join selectivity is low, we present improvements upon the state-of-the-art with a view to decreasing the communication cost and the maximum load a reducer can receive, taking also into account the load imbalance across the reducers. 1. |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3363 |
| Availability: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3363; http://ceur-ws.org/Vol-1133/paper-02.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.443E4176 |
| Database: | BASE |