<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: That Syncing Feeling &#8211; Safety Is Expensive</title>
	<atom:link href="http://curiousprogrammer.wordpress.com/2010/09/21/that-syncing-feeling-safety-is-expensive/feed/" rel="self" type="application/rss+xml" />
	<link>http://curiousprogrammer.wordpress.com/2010/09/21/that-syncing-feeling-safety-is-expensive/</link>
	<description>Leveraging Perl and Emacs</description>
	<lastBuildDate>Tue, 07 May 2013 11:25:25 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: Jared</title>
		<link>http://curiousprogrammer.wordpress.com/2010/09/21/that-syncing-feeling-safety-is-expensive/#comment-8372</link>
		<dc:creator><![CDATA[Jared]]></dc:creator>
		<pubDate>Wed, 22 Sep 2010 21:46:17 +0000</pubDate>
		<guid isPermaLink="false">http://curiousprogrammer.wordpress.com/?p=1261#comment-8372</guid>
		<description><![CDATA[Hi Zbigniew,

I haven&#039;t done the like-for-like RDBMS comparison.  However, I do have an RDBMS based system I looking to replace that can handle a peak of about 120 updates/sec on significantly superior hardware than my laptop.  It&#039;s also doing a lot more work than is demonstrated in the benchmark.  If I added the rest of the updates and required indices, I suspect I&#039;d probably be able to get 500 updates/sec with Berkeley DB and syncing after every request.  That probably isn&#039;t quite fast enough for my needs.]]></description>
		<content:encoded><![CDATA[<p>Hi Zbigniew,</p>
<p>I haven&#8217;t done the like-for-like RDBMS comparison.  However, I do have an RDBMS based system I looking to replace that can handle a peak of about 120 updates/sec on significantly superior hardware than my laptop.  It&#8217;s also doing a lot more work than is demonstrated in the benchmark.  If I added the rest of the updates and required indices, I suspect I&#8217;d probably be able to get 500 updates/sec with Berkeley DB and syncing after every request.  That probably isn&#8217;t quite fast enough for my needs.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Zbigniew Lukasiak</title>
		<link>http://curiousprogrammer.wordpress.com/2010/09/21/that-syncing-feeling-safety-is-expensive/#comment-8371</link>
		<dc:creator><![CDATA[Zbigniew Lukasiak]]></dc:creator>
		<pubDate>Wed, 22 Sep 2010 07:03:55 +0000</pubDate>
		<guid isPermaLink="false">http://curiousprogrammer.wordpress.com/?p=1261#comment-8371</guid>
		<description><![CDATA[By the way did you measure the RDBMs solutions?  I am curious how SQLite would fare here - it can be quite fast for simple operations.]]></description>
		<content:encoded><![CDATA[<p>By the way did you measure the RDBMs solutions?  I am curious how SQLite would fare here &#8211; it can be quite fast for simple operations.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jared</title>
		<link>http://curiousprogrammer.wordpress.com/2010/09/21/that-syncing-feeling-safety-is-expensive/#comment-8370</link>
		<dc:creator><![CDATA[Jared]]></dc:creator>
		<pubDate>Wed, 22 Sep 2010 06:43:56 +0000</pubDate>
		<guid isPermaLink="false">http://curiousprogrammer.wordpress.com/?p=1261#comment-8370</guid>
		<description><![CDATA[Hi Pedro,

This is exactly the kind of comment that makes me keep blogging.  Great information!  I hadn&#039;t come across Tokyo Cabinet and it looks like exactly what I have been looking for, for more than 5 years!

I had been intending to benchmark Redis next.

Cheers]]></description>
		<content:encoded><![CDATA[<p>Hi Pedro,</p>
<p>This is exactly the kind of comment that makes me keep blogging.  Great information!  I hadn&#8217;t come across Tokyo Cabinet and it looks like exactly what I have been looking for, for more than 5 years!</p>
<p>I had been intending to benchmark Redis next.</p>
<p>Cheers</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Pedro Melo</title>
		<link>http://curiousprogrammer.wordpress.com/2010/09/21/that-syncing-feeling-safety-is-expensive/#comment-8368</link>
		<dc:creator><![CDATA[Pedro Melo]]></dc:creator>
		<pubDate>Tue, 21 Sep 2010 11:38:57 +0000</pubDate>
		<guid isPermaLink="false">http://curiousprogrammer.wordpress.com/?p=1261#comment-8368</guid>
		<description><![CDATA[Several comments:

 * if you don&#039;t need the full power of Storable, try JSON::XS: on my benchmarks is faster than Storable, and the end result is user readable and reusable from other languages;
 * BerkleyDB is not the fastest disk DB in town. I would also experiment with Tokyo Cabinet (http://fallabs.com/tokyocabinet/);
 * Also interesting to try would be Redis. Given that it would run on a separate process, with pipeline commands you should be able to get decent performance.]]></description>
		<content:encoded><![CDATA[<p>Several comments:</p>
<p> * if you don&#8217;t need the full power of Storable, try JSON::XS: on my benchmarks is faster than Storable, and the end result is user readable and reusable from other languages;<br />
 * BerkleyDB is not the fastest disk DB in town. I would also experiment with Tokyo Cabinet (<a href="http://fallabs.com/tokyocabinet/" rel="nofollow">http://fallabs.com/tokyocabinet/</a>);<br />
 * Also interesting to try would be Redis. Given that it would run on a separate process, with pipeline commands you should be able to get decent performance.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
