Miles Osborne wrote:
this is perhaps worth watching:
http://www.youtube.com/watch?v=BT-piFBP4fE&feature=channel
it deals with finding the shortest path in a graph using MR. here at
work i don't have audio working so i'm not 100% sure that this is the
best way to do it, but it is a start.
Thanks guys - I watched the video, and I think I'm doing something
similar in concept, but it's taking N + 1 jobs ... I still need to
figure out a way to detect cycles.
Map reduce may not be the best platform for this, it's true. But it
would probably take more effort to retool my workshop ... ;)
--
Best regards,
Andrzej Bialecki <><
___. ___ ___ ___ _ _ __________________________________
[__ || __|__/|__||\/| Information Retrieval, Semantic Web
___|||__|| \| || | Embedded Unix, System Integration
http://www.sigram.com Contact: info at sigram dot com
