<?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: Getting data to the cloud</title>
	<atom:link href="http://www.electric-cloud.com/blog/2009/09/14/getting-data-to-the-cloud/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.electric-cloud.com/blog/2009/09/14/getting-data-to-the-cloud/</link>
	<description>This is your source for private development cloud best practices and technical tips and tricks for Electric Cloud solutions</description>
	<lastBuildDate>Thu, 03 May 2012 01:47:53 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Eric Melski</title>
		<link>http://www.electric-cloud.com/blog/2009/09/14/getting-data-to-the-cloud/#comment-77</link>
		<dc:creator>Eric Melski</dc:creator>
		<pubDate>Mon, 04 Jan 2010 18:48:54 +0000</pubDate>
		<guid isPermaLink="false">http://blog.electric-cloud.com/?p=539#comment-77</guid>
		<description>That&#039;s an excellent question.  In fact LBFS and rsync definitely share some concepts, but you can think of LBFS as going further than rsync does.  With rsync, we compute a checksum for each block of a file, then ask the target, &quot;hey, is the checksum for block 1 of file A the same as what I have computed?&quot;  If so, then rsync saves by not transferring that block.

With LBFS, it actually looks for identical blocks at different locations within the same file and even across files.  So on the source host we compute a checksum for chunk A-1, and then say to the target host, &quot;hey, do you have a chunk (from any location in any file) that matches this checksum?&quot;  If a matching chunk is found, it gets stitched into file A on the target machine.  This gives you the potential for even more savings than rsync can provide.

Thanks for the comment!</description>
		<content:encoded><![CDATA[<p>That&#8217;s an excellent question.  In fact LBFS and rsync definitely share some concepts, but you can think of LBFS as going further than rsync does.  With rsync, we compute a checksum for each block of a file, then ask the target, &#8220;hey, is the checksum for block 1 of file A the same as what I have computed?&#8221;  If so, then rsync saves by not transferring that block.</p>
<p>With LBFS, it actually looks for identical blocks at different locations within the same file and even across files.  So on the source host we compute a checksum for chunk A-1, and then say to the target host, &#8220;hey, do you have a chunk (from any location in any file) that matches this checksum?&#8221;  If a matching chunk is found, it gets stitched into file A on the target machine.  This gives you the potential for even more savings than rsync can provide.</p>
<p>Thanks for the comment!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Marek</title>
		<link>http://www.electric-cloud.com/blog/2009/09/14/getting-data-to-the-cloud/#comment-76</link>
		<dc:creator>Marek</dc:creator>
		<pubDate>Mon, 04 Jan 2010 15:32:46 +0000</pubDate>
		<guid isPermaLink="false">http://blog.electric-cloud.com/?p=539#comment-76</guid>
		<description>Is not the same as rsync ?
http://en.wikipedia.org/wiki/Rsync</description>
		<content:encoded><![CDATA[<p>Is not the same as rsync ?<br />
<a href="http://en.wikipedia.org/wiki/Rsync" rel="nofollow">http://en.wikipedia.org/wiki/Rsync</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>

