-
Committer:
John Arbash Meinel
-
Date:
2010-03-29 23:19:48 UTC
-
Revision ID:
john@arbash-meinel.com-20100329231948-iatmwi5hosf3uyhp
Work on a document describing how we can break up graph information.
The idea is to store the information minimally, but then create some denormalized
ancestry tables. They won't be completely denormalized (so you don't run into
always checking all of history, but you also won't have to step-by-one all the time
either).