<?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: Google Caffeine: A Comprehensive Analysis</title>
	<atom:link href="http://www.vizioninteractive.com/google-caffeine-a-comprehensive-analysis/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.vizioninteractive.com/google-caffeine-a-comprehensive-analysis/</link>
	<description>Search Engine Optimization Company</description>
	<lastBuildDate>Thu, 15 Apr 2010 19:10:06 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Steve Johnson</title>
		<link>http://www.vizioninteractive.com/google-caffeine-a-comprehensive-analysis/comment-page-1/#comment-17781</link>
		<dc:creator>Steve Johnson</dc:creator>
		<pubDate>Thu, 12 Nov 2009 07:50:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.vizioninteractive.com/?p=2116#comment-17781</guid>
		<description>I&#039;ve read that Google Caffeine is going to put more emphasis on websites that keep their material fresh using relevant content. And penalize websites that have become stagnant for a long period of time. 

In other words, if there&#039;s no detectable activity within a certain time period, say a year or so, the site will get dropped into the recesses of the Internet. Have you heard anything similar?


Best Regards, 

Steve</description>
		<content:encoded><![CDATA[<p>I&#8217;ve read that Google Caffeine is going to put more emphasis on websites that keep their material fresh using relevant content. And penalize websites that have become stagnant for a long period of time. </p>
<p>In other words, if there&#8217;s no detectable activity within a certain time period, say a year or so, the site will get dropped into the recesses of the Internet. Have you heard anything similar?</p>
<p>Best Regards, </p>
<p>Steve</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Credit Card Debt Services</title>
		<link>http://www.vizioninteractive.com/google-caffeine-a-comprehensive-analysis/comment-page-1/#comment-17759</link>
		<dc:creator>Credit Card Debt Services</dc:creator>
		<pubDate>Tue, 10 Nov 2009 06:24:09 +0000</pubDate>
		<guid isPermaLink="false">http://www.vizioninteractive.com/?p=2116#comment-17759</guid>
		<description>My name is James.. I was just testing Google caffeine for search results and got this message seems to be great news... I think the new Google is incredibly faster and has more accurate search results.

http://www.google.com/errors/caffeine/unavailable.html

 We appreciate all the feedback from people who searched on our Caffeine sandbox.

Based on the success we&#039;ve seen, we believe Caffeine is ready for a larger audience. Soon we will activate Caffeine more widely, beginning with one data center. This sandbox is no longer necessary and has been retired, but we appreciate the testing and positive input that webmasters and publishers have given.</description>
		<content:encoded><![CDATA[<p>My name is James.. I was just testing Google caffeine for search results and got this message seems to be great news&#8230; I think the new Google is incredibly faster and has more accurate search results.</p>
<p><a href="http://www.google.com/errors/caffeine/unavailable.html" rel="nofollow" target="_blank">http://www.google.com/errors/caffeine/unavailable.html</a></p>
<p> We appreciate all the feedback from people who searched on our Caffeine sandbox.</p>
<p>Based on the success we&#8217;ve seen, we believe Caffeine is ready for a larger audience. Soon we will activate Caffeine more widely, beginning with one data center. This sandbox is no longer necessary and has been retired, but we appreciate the testing and positive input that webmasters and publishers have given.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
