This document discusses various graph algorithms techniques that can be implemented in MapReduce frameworks: 1. Local aggregation reduces the amount of intermediate data using combiners and in-mapper aggregation to minimize network traffic. 2. The "pairs" and "stripes" patterns refer to different ways of organizing intermediate co-occurrence data from document analysis tasks. Stripes using associative arrays can better utilize combiners. 3. Order inversion allows relative frequencies to be computed in one MapReduce job by signaling marginal totals ahead of detailed records.