This document contains an excerpt from a 2010 presentation on scaling distributed graph data in a graph database. It discusses how graph databases are optimized for modeling relationships rather than tables. While graphs grow quickly to billions of elements, their algorithms can naturally distribute across partitions. Effective techniques involve best effort partitioning, distributed APIs, and lookahead strategies to balance workload and minimize write costs during healing.