of
are indexed join, unequal join, semijoin)
Thanks,
Daniel
On Sat, Apr 6, 2013 at 2:17 AM, burakkk burak.isi...@gmail.com wrote:
Hi,
I examined a little bit about pig's roadmap page and I'm interested in
working on some of them. I found that you might be working on in these
items
Hi,
I examined a little bit about pig's roadmap page and I'm interested in
working on some of them. I found that you might be working on in these
items. But I couldn't find any issue on jira about them. Is anyone working
on them and if not, how can I contribute it? I mean should I create issues
So what do you suggest? Is it clear?
On Mon, Apr 1, 2013 at 9:35 PM, burakkk burak.isi...@gmail.com wrote:
I'm using only WTF graph representation to fit the memory. By the way I
haven't seen any explanation from the pig 0.11 release page about WTF or
graph models.
I don't wanna use
at 7:20 PM, Gianmarco De Francisci Morales g...@gdfm.me
wrote:
FYI, Giraph has a Random Walk implementation.
Pig does not support iteration natively, so any iterative algorithm is not
a very good fit for it. Just my 2c.
Cheers,
--
Gianmarco
On Tue, Apr 2, 2013 at 10:04 AM, burakkk
at 10:12 AM, burakkk burak.isi...@gmail.com wrote:
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
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
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
