<?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"
	>
<channel>
	<title>Comments on: Yeah</title>
	<atom:link href="http://www.c10n.info/archives/404/feed" rel="self" type="application/rss+xml" />
	<link>http://www.c10n.info/archives/404</link>
	<description>All about the most recent compression techniques, algorithms, patents, products, tools and events.</description>
	<pubDate>Thu, 08 Jan 2009 19:18:59 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6</generator>
		<item>
		<title>By: Mark</title>
		<link>http://www.c10n.info/archives/404#comment-1839</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Mon, 08 May 2006 18:35:41 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1839</guid>
		<description>Just to give you an idea of how unimpressive this might be, the backup program I use on my PC reported this when I last ran on Friday night:

5/5/2006 5:29:21 PM Backup completed. 2001 of 2001 files securely backed up. Total Backup Size: 4.74 GB, Optimized Backup Size: 323.5 MB, Compressed Backup Size: 241.8 MB.

Now, that's 20:1 compression, right?</description>
		<content:encoded><![CDATA[<p>Just to give you an idea of how unimpressive this might be, the backup program I use on my PC reported this when I last ran on Friday night:</p>
<p>5/5/2006 5:29:21 PM Backup completed. 2001 of 2001 files securely backed up. Total Backup Size: 4.74 GB, Optimized Backup Size: 323.5 MB, Compressed Backup Size: 241.8 MB.</p>
<p>Now, that&#8217;s 20:1 compression, right?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: storagemojo.com</title>
		<link>http://www.c10n.info/archives/404#comment-1838</link>
		<dc:creator>storagemojo.com</dc:creator>
		<pubDate>Mon, 08 May 2006 17:19:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1838</guid>
		<description>Are there benchmarks for this kind of compression? Check out Data Domain's &lt;a href="http://datadomain.com/pdf/DataDomain-DD400-Whitepaper.pdf" rel="nofollow"&gt;pretty good pdf whitepaper&lt;/a&gt; page 14 where they state: &lt;i&gt;The first full backup results in 3-4x data reduction. File level incrementals will see 6-7x and subsequent full backups will see 50-60x data reduction ratios. The aggregate with Weekly Fulls and Daily Incrementals is 20x.&lt;/i&gt; 

If it doesn't exist it would be useful to create such a benchmark because, if it works, this technology is going to be very popular.</description>
		<content:encoded><![CDATA[<p>Are there benchmarks for this kind of compression? Check out Data Domain&#8217;s <a href="http://datadomain.com/pdf/DataDomain-DD400-Whitepaper.pdf" rel="nofollow" onclick="javascript:pageTracker._trackPageview ('/outbound/datadomain.com');">pretty good pdf whitepaper</a> page 14 where they state: <i>The first full backup results in 3-4x data reduction. File level incrementals will see 6-7x and subsequent full backups will see 50-60x data reduction ratios. The aggregate with Weekly Fulls and Daily Incrementals is 20x.</i> </p>
<p>If it doesn&#8217;t exist it would be useful to create such a benchmark because, if it works, this technology is going to be very popular.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark</title>
		<link>http://www.c10n.info/archives/404#comment-1827</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Sat, 06 May 2006 20:31:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1827</guid>
		<description>And let me add, my first comment was that they should be benchmarking their claims, and I stand by that. With no reasonable benchmarks, their claims are worthless.</description>
		<content:encoded><![CDATA[<p>And let me add, my first comment was that they should be benchmarking their claims, and I stand by that. With no reasonable benchmarks, their claims are worthless.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark</title>
		<link>http://www.c10n.info/archives/404#comment-1826</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Sat, 06 May 2006 20:29:47 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1826</guid>
		<description>well, my comment was unnecessarily harsh, but I sometimes get a bit overwhelmed by the level of scamming in PR on this topic.

Your scrutiny is correct, these guys are saying that they use existing data as a dictionary to compress files.

However, their claim of 25:1 is bogus in this respect: if I create a new word document, database, spreadsheet, or whatever, and then have it backed up, their system will not back it up at 25:1 ratios.

The way they cook up numbers like this is by the misleading notion that they might be able to backup the next version of that file at 25:1.

True enough, but not that remarkable, and it is definitely not going to reduce your backup storage requirements by 25. The interesting quesiton is how much your storage requirements will be reduced in comparison to a normal backup system using file timestamps and zip-like compression. I suspect the results would not be phenomenal.</description>
		<content:encoded><![CDATA[<p>well, my comment was unnecessarily harsh, but I sometimes get a bit overwhelmed by the level of scamming in PR on this topic.</p>
<p>Your scrutiny is correct, these guys are saying that they use existing data as a dictionary to compress files.</p>
<p>However, their claim of 25:1 is bogus in this respect: if I create a new word document, database, spreadsheet, or whatever, and then have it backed up, their system will not back it up at 25:1 ratios.</p>
<p>The way they cook up numbers like this is by the misleading notion that they might be able to backup the next version of that file at 25:1.</p>
<p>True enough, but not that remarkable, and it is definitely not going to reduce your backup storage requirements by 25. The interesting quesiton is how much your storage requirements will be reduced in comparison to a normal backup system using file timestamps and zip-like compression. I suspect the results would not be phenomenal.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Robin Harris</title>
		<link>http://www.c10n.info/archives/404#comment-1825</link>
		<dc:creator>Robin Harris</dc:creator>
		<pubDate>Sat, 06 May 2006 19:41:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1825</guid>
		<description>Mike,

I wrote the &lt;a href="http://storagemojo.com" rel="nofollow"&gt;blog post &lt;/a&gt;you excoriate. I appreciate the link, if not the sentiments as I am still getting a steady stream of visitors from your site, presumably to gratify their sense of superiority. Or maybe they just want to learn something about a compression.

I think it is fine for professionals to use a specialized vocabulary to make subtle points - that is the mark of a professional, after all. But that doesn't mean it is right for the general IT buying public. 

Data Domain, Diligent and others have a very cool technology that actually works to dramatically reduce the size of backups, making disk to disk backup economically feasible. Which, given the flakiness of tape backup, is a Very Good Thing. But they are having a hard time communicating that fact because, being very well versed in compression technology themselves, they refuse to use the word that your average IT manager would understand: compression. 

This is why techies need smart marketing people: to get them to do what *works* instead of what is *correct* and *doesn't* work. Dominated by smart techies, neither company is doing what is takes to really sell their product.

No one barfs over calling (maybe you do, though) MPEG-4 "compression" even though it is functionally equivalent to what DD, Diligent, et.al. do. I understand that MPEG-4 is essentially a toolkit of techniques optimized for certain scenarios, and not Shannon-style compression. And guess what, I and the other millions of people using it don't care.

Check out the last &lt;a href="http://storagemojo.com/?p=47" rel="nofollow"&gt; post of mine&lt;/a&gt; on the subject. I welcome your comments.

Sincerely,

Robin Harris</description>
		<content:encoded><![CDATA[<p>Mike,</p>
<p>I wrote the <a href="http://storagemojo.com" rel="nofollow" onclick="javascript:pageTracker._trackPageview ('/outbound/storagemojo.com');">blog post </a>you excoriate. I appreciate the link, if not the sentiments as I am still getting a steady stream of visitors from your site, presumably to gratify their sense of superiority. Or maybe they just want to learn something about a compression.</p>
<p>I think it is fine for professionals to use a specialized vocabulary to make subtle points - that is the mark of a professional, after all. But that doesn&#8217;t mean it is right for the general IT buying public. </p>
<p>Data Domain, Diligent and others have a very cool technology that actually works to dramatically reduce the size of backups, making disk to disk backup economically feasible. Which, given the flakiness of tape backup, is a Very Good Thing. But they are having a hard time communicating that fact because, being very well versed in compression technology themselves, they refuse to use the word that your average IT manager would understand: compression. </p>
<p>This is why techies need smart marketing people: to get them to do what *works* instead of what is *correct* and *doesn&#8217;t* work. Dominated by smart techies, neither company is doing what is takes to really sell their product.</p>
<p>No one barfs over calling (maybe you do, though) MPEG-4 &#8220;compression&#8221; even though it is functionally equivalent to what DD, Diligent, et.al. do. I understand that MPEG-4 is essentially a toolkit of techniques optimized for certain scenarios, and not Shannon-style compression. And guess what, I and the other millions of people using it don&#8217;t care.</p>
<p>Check out the last <a href="http://storagemojo.com/?p=47" rel="nofollow" onclick="javascript:pageTracker._trackPageview ('/outbound/storagemojo.com');"> post of mine</a> on the subject. I welcome your comments.</p>
<p>Sincerely,</p>
<p>Robin Harris</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mark</title>
		<link>http://www.c10n.info/archives/404#comment-1415</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Mon, 10 Apr 2006 15:02:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1415</guid>
		<description>Michael Harrington, a pox on thee!

You have two strikes against you.

1) "The basic maths are outside the normal scope of math". There is no such thing as being "outside the normal scope of math", this is just BS talk, total garbage.

2) "An open reward for the first to create functional software". This only means that your so-called white paper is senseless crap that has nothing even resembling an algorithm in it.</description>
		<content:encoded><![CDATA[<p>Michael Harrington, a pox on thee!</p>
<p>You have two strikes against you.</p>
<p>1) &#8220;The basic maths are outside the normal scope of math&#8221;. There is no such thing as being &#8220;outside the normal scope of math&#8221;, this is just BS talk, total garbage.</p>
<p>2) &#8220;An open reward for the first to create functional software&#8221;. This only means that your so-called white paper is senseless crap that has nothing even resembling an algorithm in it.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Harrington</title>
		<link>http://www.c10n.info/archives/404#comment-1406</link>
		<dc:creator>Michael Harrington</dc:creator>
		<pubDate>Mon, 10 Apr 2006 07:11:38 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1406</guid>
		<description>I have actually written a new whitepaper proving a new means of lossless compression. The basic maths are outside the normal scope of math but it does work. 

A serious amount of compression can be achieved via cycling on random binary data. The odds are incredibly high against a random occurence that can stop the compression, and those are extremely easy to handle, they compress via other means quite easily. 

My url talks about it &lt;a href="http://www.security1.free2host.net/Compress/compressstart.php" rel="nofollow"&gt;Security1&lt;/a&gt;


There is an open challenge to disprove my claims, via actually using my created methods. There is also an open reward for the first to create functional software.</description>
		<content:encoded><![CDATA[<p>I have actually written a new whitepaper proving a new means of lossless compression. The basic maths are outside the normal scope of math but it does work. </p>
<p>A serious amount of compression can be achieved via cycling on random binary data. The odds are incredibly high against a random occurence that can stop the compression, and those are extremely easy to handle, they compress via other means quite easily. </p>
<p>My url talks about it <a href="http://www.security1.free2host.net/Compress/compressstart.php" rel="nofollow" onclick="javascript:pageTracker._trackPageview ('/outbound/www.security1.free2host.net');">Security1</a></p>
<p>There is an open challenge to disprove my claims, via actually using my created methods. There is also an open reward for the first to create functional software.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Alfredo De la Cruz</title>
		<link>http://www.c10n.info/archives/404#comment-1361</link>
		<dc:creator>Alfredo De la Cruz</dc:creator>
		<pubDate>Thu, 06 Apr 2006 07:41:34 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1361</guid>
		<description>Mark, this time there is no talk about data compression claims. What the author at StorageMojo (shame on him/her!) wrote is confusing the term compression instead of data reduction.
Diligent claims are rather in the sense of optimization techniques applied to the data set to be stored, and that belongs to another category where several product already exists, at least in the WAN arena.</description>
		<content:encoded><![CDATA[<p>Mark, this time there is no talk about data compression claims. What the author at StorageMojo (shame on him/her!) wrote is confusing the term compression instead of data reduction.<br />
Diligent claims are rather in the sense of optimization techniques applied to the data set to be stored, and that belongs to another category where several product already exists, at least in the WAN arena.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Krisjohn</title>
		<link>http://www.c10n.info/archives/404#comment-1359</link>
		<dc:creator>Krisjohn</dc:creator>
		<pubDate>Thu, 06 Apr 2006 01:11:03 +0000</pubDate>
		<guid isPermaLink="false">http://www.c10n.info/archives/404#comment-1359</guid>
		<description>I left Slashdot after yet another perpetual motion story.  I don't think you need to debunk anything just because it's posted there.</description>
		<content:encoded><![CDATA[<p>I left Slashdot after yet another perpetual motion story.  I don&#8217;t think you need to debunk anything just because it&#8217;s posted there.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
