Sure. We can implement a graph model using "WTF: The Who to Follow Service at Twitter article we can" article.This article's said that in this way graph can be stored one machine's memory so that every node will read from HDFS and cache the graph to the memory. Every node is responsible from its bucket edge to process. I mean it can be splitted. Every node can be processed its bucket using random walk algorithm for instance. Finally it can be reduced to get to the final results. I hope it's clear :)
Thanks Best Regards... On Fri, Mar 29, 2013 at 6:10 PM, Dmitriy Ryaboy <dvrya...@gmail.com> wrote: > Hi Burakk, > The general idea of making graph processing easier is a good one. I'm not > sure what exactly you are proposing to do, though. Could you be more > detailed about what you are thinking? > > > On Thu, Mar 28, 2013 at 1:28 PM, burakkk <burak.isi...@gmail.com> wrote: > > > Hi, > > I might be a little bit late. I come up with a new idea for the last > > minute. Currently I'm working on social graph processing. I think we can > > implement a solution for pig. With this idea I'm thinking to apply the > > GSOC 2013 so that I can do some tasks about it. Is there any mentor to do > > it with me? Is there any suggestion? :) > > > > Details: > > Of course I can improve some join operations. I'm not sure is there any > > implementation about fuzzy joins for instance. These are the papers that > I > > found > > > > Fuzzy Joins Using MapReduce > > http://ilpubs.stanford.edu:8090/1006/ > > > > Dimension independent similarity computation > > http://arxiv.org/abs/1206.2082 > > > > MapReduce is Good Enough? If All You Have is a Hammer, Throw Away > > Everything That’s Not a Nail! > > http://arxiv.org/pdf/1209.2191.pdf > > > > Large Graph Processing in the Cloud > > http://www.ntu.edu.sg/home/bshe/sigmod10_demo.pdf > > > > ..etc > > > > Thanks > > Best regards.. > > > > > > -- > > > > *BURAK ISIKLI** *| *http://burakisikli.wordpress.com* > > * > > * > > > -- *BURAK ISIKLI** *| *http://burakisikli.wordpress.com* * *
