This document discusses challenges in assigning different sized inputs to reducers in MapReduce. It introduces the MapReduce programming model and describes two mapping schema problems: (1) the all-to-all mapping problem, where every pair of inputs must be assigned to a reducer, and (2) the X-to-Y mapping problem, where inputs from two disjoint sets must be assigned together. Both problems aim to minimize the number of reducers used while respecting reducer capacity limits. The problems are NP-hard for more than one or two reducers. Several heuristics are discussed to solve the problems, including bin packing algorithms.