1. The document discusses GoFFish, a sub-graph centric programming model for large scale graph analytics. It partitions graphs into connected sub-graphs that are processed independently in parallel. 2. GoFFish showed significant performance improvements over traditional vertex-centric models for connected components and single source shortest path algorithms, with speedups of up to 81x and 38x respectively. 3. While PageRank was less suited to the sub-graph model, overall GoFFish demonstrated it can efficiently analyze large graphs distributed across a cluster using a simple sub-graph centric programming approach.