Check out PIG. You can do SQL like Map/Reduces using it. Thats the best
answer I have
On Sat, Apr 24, 2010 at 12:27 AM, Sebastian Feher wrote:
> Hi Robin,
>
> Thanks for your answer. Yes, I do understand that FPGrowth gives you the
> most frequent co-occurrences and some of the more interesting
Thanks Sonal.
Do you have any example of how to use your framework?
Also a few other questions:
What do you mean by "It supports table joins"? I probably missed the meaning of
this as I need to understand more about how Hadoop works.
I've seen it mentioned that HIHO supports MySQL. How about othe
Hi Robin,
Thanks for your answer. Yes, I do understand that FPGrowth gives you the most
frequent co-occurrences and some of the more interesting ones are not pairs
(not to say that pairs are not interesting). However this is not what I want in
this case. I need all the pairs for a given active
Hi Sebastian, Let me get your use case right, You cant to do a pair counting
like a join. you might need to use PIG or something similar to do this
easily. Mahout's PFPGrowth counts the co-occurring, frequent n-items not
just co-occurrence of two items. There you just need either one of the
viewed
Hi Sebastian,
You could use the HIHO framework for querying and extracting data from the
database and getting it to Hadoop. It supports table joins. More here:
http://code.google.com/p/hiho/
If you need any help, please feel free to contact me directly.
Thanks and Regards,
Sonal
www.meghsoft.co
Hi everyone,
Yesterday I've started to look into Hadoop as I was trying to understand
Mahout's FPGrowth algorithm.
I have a few questions:
Given that I have two tables containing information about items that were
viewed and the second one with items that were bought:
ItemsViewed Table:
Sessi
