<?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: Scale, Scale, Scale</title>
	<atom:link href="http://blog.socialping.com/2010/05/scale-scale-scale/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.socialping.com/2010/05/scale-scale-scale/</link>
	<description>Twitter Analytics, Monitoring, and Notifications</description>
	<lastBuildDate>Thu, 21 Apr 2011 15:40:41 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	
	<item>
		<title>By: Joel Strellner</title>
		<link>http://blog.socialping.com/2010/05/scale-scale-scale/#comment-113</link>
		<dc:creator>Joel Strellner</dc:creator>
		<pubDate>Mon, 31 May 2010 16:31:31 +0000</pubDate>
		<guid isPermaLink="false">http://blog.socialping.com/?p=85#comment-113</guid>
		<description>Hi Min,

Yes, you do need to have the entire data set in memory.  Fortunately, for our needs this is easily possible, we are only at 1.5 GB worth of data (about 3.5 million keys).

We do not currently use clustering or sharding.  We&#039;ve got one server for Redis, and we&#039;ll be bringing up a slave this week as a backup.  Because we were fighting high loads and needed to get a solution up ASAP, we opted to bring just a master up at the time and then the slave later on.</description>
		<content:encoded><![CDATA[<p>Hi Min,</p>
<p>Yes, you do need to have the entire data set in memory.  Fortunately, for our needs this is easily possible, we are only at 1.5 GB worth of data (about 3.5 million keys).</p>
<p>We do not currently use clustering or sharding.  We&#8217;ve got one server for Redis, and we&#8217;ll be bringing up a slave this week as a backup.  Because we were fighting high loads and needed to get a solution up ASAP, we opted to bring just a master up at the time and then the slave later on.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Min</title>
		<link>http://blog.socialping.com/2010/05/scale-scale-scale/#comment-111</link>
		<dc:creator>Min</dc:creator>
		<pubDate>Mon, 31 May 2010 03:15:59 +0000</pubDate>
		<guid isPermaLink="false">http://blog.socialping.com/?p=85#comment-111</guid>
		<description>Could you explain more about your redis setup? From what I understand about redis, you have to have the entire data set in the memory.. I&#039;d like to hear how you&#039;ve clustered or plan to cluster the redis servers.</description>
		<content:encoded><![CDATA[<p>Could you explain more about your redis setup? From what I understand about redis, you have to have the entire data set in the memory.. I&#8217;d like to hear how you&#8217;ve clustered or plan to cluster the redis servers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Joel Strellner</title>
		<link>http://blog.socialping.com/2010/05/scale-scale-scale/#comment-109</link>
		<dc:creator>Joel Strellner</dc:creator>
		<pubDate>Mon, 31 May 2010 00:46:06 +0000</pubDate>
		<guid isPermaLink="false">http://blog.socialping.com/?p=85#comment-109</guid>
		<description>Hi Sunil,

We&#039;re using the hash type primarily for stats. Since everything we do is based on tags, we can create a hash for a tag with fields for each of the stats we track for that tag, then in real-time we can do HINCRBY for the items that we want to adjust the stats on.  When we want to get the stats, it&#039;s just one HGETALL call (via a function that turns it into a native array) and we can have all of the stats.

The beauty of this is twofold, first since redis is so fast, there doesn&#039;t appear to be any additional overhead vs a standard string GET, and second, we&#039;ve reduced latency in the interface because in just one call we&#039;ve got all of the stats.</description>
		<content:encoded><![CDATA[<p>Hi Sunil,</p>
<p>We&#8217;re using the hash type primarily for stats. Since everything we do is based on tags, we can create a hash for a tag with fields for each of the stats we track for that tag, then in real-time we can do HINCRBY for the items that we want to adjust the stats on.  When we want to get the stats, it&#8217;s just one HGETALL call (via a function that turns it into a native array) and we can have all of the stats.</p>
<p>The beauty of this is twofold, first since redis is so fast, there doesn&#8217;t appear to be any additional overhead vs a standard string GET, and second, we&#8217;ve reduced latency in the interface because in just one call we&#8217;ve got all of the stats.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: _sunil_</title>
		<link>http://blog.socialping.com/2010/05/scale-scale-scale/#comment-106</link>
		<dc:creator>_sunil_</dc:creator>
		<pubDate>Sun, 30 May 2010 13:49:59 +0000</pubDate>
		<guid isPermaLink="false">http://blog.socialping.com/?p=85#comment-106</guid>
		<description>Would be great if you can explain how are you using hashes in redis ?</description>
		<content:encoded><![CDATA[<p>Would be great if you can explain how are you using hashes in redis ?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

