<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Search Computing Blog &#187; scalability</title>
	<atom:link href="http://blog.search-computing.net/tag/scalability/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.search-computing.net</link>
	<description></description>
	<lastBuildDate>Tue, 30 Aug 2011 06:38:40 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.5</generator>
		<item>
		<title>Project Voldemort: a distributed, fast and reliable key-value store</title>
		<link>http://blog.search-computing.net/2010/05/project-voldemort-a-distributed-fast-and-reliable-key-value-store/</link>
		<comments>http://blog.search-computing.net/2010/05/project-voldemort-a-distributed-fast-and-reliable-key-value-store/#comments</comments>
		<pubDate>Mon, 03 May 2010 08:26:40 +0000</pubDate>
		<dc:creator>Salvatore Vadacca</dc:creator>
				<category><![CDATA[Tutorial]]></category>
		<category><![CDATA[distribution]]></category>
		<category><![CDATA[key-value store]]></category>
		<category><![CDATA[Linkedin]]></category>
		<category><![CDATA[scalability]]></category>
		<category><![CDATA[Voldemort]]></category>

		<guid isPermaLink="false">http://blog.search-computing.net/?p=369</guid>
		<description><![CDATA[In the last few years non-relational data stores have drawn the attention of researchers and pratictioners. Their lack of fixed table schemas and the avoidance of join operators allow these tools to scale horizontally, storing huge amounts of data and providing high-performance access to it. This class of databases (also known as NoSQL databases) often employs a [...]]]></description>
		<wfw:commentRss>http://blog.search-computing.net/2010/05/project-voldemort-a-distributed-fast-and-reliable-key-value-store/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Load balancing with Apache: a tutorial on mod_proxy_balancer installation and configuration</title>
		<link>http://blog.search-computing.net/2010/04/load-balancing-with-apache-a-tutorial-on-mod_proxy_balancer-installation-and-configuration/</link>
		<comments>http://blog.search-computing.net/2010/04/load-balancing-with-apache-a-tutorial-on-mod_proxy_balancer-installation-and-configuration/#comments</comments>
		<pubDate>Tue, 20 Apr 2010 15:29:55 +0000</pubDate>
		<dc:creator>Salvatore Vadacca</dc:creator>
				<category><![CDATA[Tutorial]]></category>
		<category><![CDATA[apache]]></category>
		<category><![CDATA[architecture]]></category>
		<category><![CDATA[load balancing]]></category>
		<category><![CDATA[mod_proxy_balancer]]></category>
		<category><![CDATA[scalability]]></category>

		<guid isPermaLink="false">http://blog.search-computing.net/?p=245</guid>
		<description><![CDATA[Load balancing is a technique aiming at distributing workload in a computer network, in order to optimally utilize resources, avoid overload and maximize throughput. Computer clusters rely on load balancing to distribute workload across network links, CPUs, web servers, etc. A server farm is a common application of load balancing, where multiple servers seamlessly provide a single Internet [...]]]></description>
		<wfw:commentRss>http://blog.search-computing.net/2010/04/load-balancing-with-apache-a-tutorial-on-mod_proxy_balancer-installation-and-configuration/feed/</wfw:commentRss>
		<slash:comments>8</slash:comments>
		</item>
	</channel>
</rss>

