An NSA Big Graph experiment Paul Burkhardt, Chris Waring May 20, 2013
An NSA Big Graph experiment Paul Burkhardt, Chris Waring May 20, 2013
An NSA Big Graph experiment Paul Burkhardt, Chris Waring May 20, 2013
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Big</strong> Data begets <strong>Big</strong> <strong>Graph</strong>s<br />
Increasing volume,velocity,variety of <strong>Big</strong> Data are significant<br />
challenges to scalable algorithms.<br />
<strong>Big</strong> Data <strong>Graph</strong>s<br />
How will graph applications adapt to <strong>Big</strong> Data at petabyte scale?<br />
Ability to store and process <strong>Big</strong> <strong>Graph</strong>s impacts typical data<br />
structures.<br />
Orders of magnitude<br />
kilobyte (KB) = 2 10<br />
megabyte (MB) = 2 <strong>20</strong><br />
gigabyte (GB) = 2 30<br />
terabyte (TB) = 2 40<br />
petabyte (PB) = 2 50<br />
exabyte (EB) = 2 60<br />
Undirected graph data structure space complexity<br />
8<br />
>< Θ(n<br />
Θ(bytes) ×<br />
>:<br />
2 ) adjacency matrix<br />
Θ(n + 4m)<br />
Θ(4m)<br />
adjacency list<br />
edge list<br />
<strong>Paul</strong> <strong>Burkhardt</strong>, <strong>Chris</strong> <strong>Waring</strong> <strong>An</strong> <strong>NSA</strong> <strong>Big</strong> <strong>Graph</strong> <strong>experiment</strong><br />
<strong>NSA</strong>-RD-<strong>20</strong>13-056001v1
Change language