Is there an efficient method to store large DAGs?
Try constructing a reduced ordered binary decision diagram (ROBDD) as described here. 
The reducing algorithm removes redundant nodes, and reuses equal subtrees in the decision tree, such that every node is unique.
The memory complexity of a ROBDD is $\mathcal O({2^n \over n})$ as proved here.