<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Hadoop Tutorial Series, Issue #3: Counters In Action</title>
	<atom:link href="http://philippeadjiman.com/blog/2010/01/07/hadoop-tutorial-series-issue-3-counters-in-action/feed/" rel="self" type="application/rss+xml" />
	<link>http://philippeadjiman.com/blog/2010/01/07/hadoop-tutorial-series-issue-3-counters-in-action/</link>
	<description>Just Another Blog About Geek Stuff, by Philippe Adjiman</description>
	<lastBuildDate>Tue, 23 Aug 2011 18:43:29 -0400</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Iterative algorithms in Hadoop &#171; Kenkyuu</title>
		<link>http://philippeadjiman.com/blog/2010/01/07/hadoop-tutorial-series-issue-3-counters-in-action/comment-page-1/#comment-486</link>
		<dc:creator>Iterative algorithms in Hadoop &#171; Kenkyuu</dc:creator>
		<pubDate>Fri, 10 Jun 2011 19:18:56 +0000</pubDate>
		<guid isPermaLink="false">http://philippeadjiman.com/blog/?p=818#comment-486</guid>
		<description>[...] The general idea for iterative algorithms in MapReduce is to chain multiple jobs together, using the output of the last one as the input of the next one. An important consideration is that, given the usual size of the data, the termination condition must be computed within the MapReduce program. The standard MapReduce model does not offer simple elegant ways to do this, but Hadoop has some added features that simplify this task: Counters. [...]</description>
		<content:encoded><![CDATA[<p>[...] The general idea for iterative algorithms in MapReduce is to chain multiple jobs together, using the output of the last one as the input of the next one. An important consideration is that, given the usual size of the data, the termination condition must be computed within the MapReduce program. The standard MapReduce model does not offer simple elegant ways to do this, but Hadoop has some added features that simplify this task: Counters. [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

