Efficient way to store a graph for calculation in Hadoop

Posted by user337499 on Stack Overflow See other posts from Stack Overflow or by user337499
Published on 2010-05-10T19:22:02Z Indexed on 2010/05/10 19:24 UTC
Read the original article Hit count: 161

Filed under:
|

I am currently trying to perform calculations like clustering coefficient on huge graphs with the help of Hadoop. Therefore I need an efficient way to store the graph in a way that I can easily access nodes, their neighbors and the neighbors' neighbors. The graph is quite sparse and stored in a huge tab separated file where the first field is the node from which an edge goes to the second node in field two.

Thanks in advance!

© Stack Overflow or respective owner

Related posts about hadoop

Related posts about networks