Ioannis K. Koumarelas

Learn More
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,(More)
  • 1