<?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: Not all keys created equal</title>
	<atom:link href="http://labnotes.org/2007/10/03/not-all-keys-created-equal/feed/" rel="self" type="application/rss+xml" />
	<link>http://labnotes.org/2007/10/03/not-all-keys-created-equal/</link>
	<description></description>
	<lastBuildDate>Sun, 15 Jan 2012 21:29:54 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.3.1</generator>
	<item>
		<title>By: Assaf</title>
		<link>http://labnotes.org/2007/10/03/not-all-keys-created-equal/comment-page-1/#comment-138725</link>
		<dc:creator>Assaf</dc:creator>
		<pubDate>Thu, 25 Oct 2007 18:23:35 +0000</pubDate>
		<guid isPermaLink="false">http://blog.labnotes.org/2007/10/03/not-all-keys-created-equal/#comment-138725</guid>
		<description>Thanks, I added a correction.</description>
		<content:encoded><![CDATA[<p>Thanks, I added a correction.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jan</title>
		<link>http://labnotes.org/2007/10/03/not-all-keys-created-equal/comment-page-1/#comment-138638</link>
		<dc:creator>Jan</dc:creator>
		<pubDate>Thu, 18 Oct 2007 09:33:11 +0000</pubDate>
		<guid isPermaLink="false">http://blog.labnotes.org/2007/10/03/not-all-keys-created-equal/#comment-138638</guid>
		<description>You can provide your own ids in CouchDB instead of using the auto-generation. :-)

Cheers,
Jan
--</description>
		<content:encoded><![CDATA[<p>You can provide your own ids in CouchDB instead of using the auto-generation. :-)</p>
<p>Cheers,<br />
Jan<br />
&#8211;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Julien Couvreur</title>
		<link>http://labnotes.org/2007/10/03/not-all-keys-created-equal/comment-page-1/#comment-138573</link>
		<dc:creator>Julien Couvreur</dc:creator>
		<pubDate>Wed, 10 Oct 2007 01:04:51 +0000</pubDate>
		<guid isPermaLink="false">http://blog.labnotes.org/2007/10/03/not-all-keys-created-equal/#comment-138573</guid>
		<description>This is an interesting analysis. The general question is what are the kinds of applications which you can build on top of a DHT?
The fact that Amazon implemented a shopping cart shows that they have found a way to use the hashtable to store some order information. Maybe the key is the userID and the value is an XML blob listing the itemIDs? 
If so, the same approach may work for implementing a blog, or at least a blog which does not have thousands of posts ;-)</description>
		<content:encoded><![CDATA[<p>This is an interesting analysis. The general question is what are the kinds of applications which you can build on top of a DHT?<br />
The fact that Amazon implemented a shopping cart shows that they have found a way to use the hashtable to store some order information. Maybe the key is the userID and the value is an XML blob listing the itemIDs?<br />
If so, the same approach may work for implementing a blog, or at least a blog which does not have thousands of posts ;-)</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Jason</title>
		<link>http://labnotes.org/2007/10/03/not-all-keys-created-equal/comment-page-1/#comment-138546</link>
		<dc:creator>Jason</dc:creator>
		<pubDate>Fri, 05 Oct 2007 01:52:12 +0000</pubDate>
		<guid isPermaLink="false">http://blog.labnotes.org/2007/10/03/not-all-keys-created-equal/#comment-138546</guid>
		<description>You may be interested in PHT&#039;s, which are one way to handle range queries in a DHT like memcached. One nice property is they&#039;re actually doubly log since you can jump directly into the middle of the search tree rather than walking down from the root node.

Ultimately I believe the answer is finding appropriate abstractions to deal with these systems in a better way. Currently I&#039;m enamored by how high performance de-normalized databases resemble cached forward chaining.</description>
		<content:encoded><![CDATA[<p>You may be interested in PHT&#8217;s, which are one way to handle range queries in a DHT like memcached. One nice property is they&#8217;re actually doubly log since you can jump directly into the middle of the search tree rather than walking down from the root node.</p>
<p>Ultimately I believe the answer is finding appropriate abstractions to deal with these systems in a better way. Currently I&#8217;m enamored by how high performance de-normalized databases resemble cached forward chaining.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Amazon reveals its secret key-data overlords from the planet Cloud - Laughing Meme</title>
		<link>http://labnotes.org/2007/10/03/not-all-keys-created-equal/comment-page-1/#comment-138535</link>
		<dc:creator>Amazon reveals its secret key-data overlords from the planet Cloud - Laughing Meme</dc:creator>
		<pubDate>Thu, 04 Oct 2007 06:53:24 +0000</pubDate>
		<guid isPermaLink="false">http://blog.labnotes.org/2007/10/03/not-all-keys-created-equal/#comment-138535</guid>
		<description>[...] Meanwhile Assaf argues well that not all keys are created equal [...]</description>
		<content:encoded><![CDATA[<p>[...] Meanwhile Assaf argues well that not all keys are created equal [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

