<?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: On Building a Stupidly Fast Graph Database</title>
	<atom:link href="http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/</link>
	<description></description>
	<lastBuildDate>Wed, 16 Mar 2011 20:49:34 -0700</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Jerng</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-9706</link>
		<dc:creator>Jerng</dc:creator>
		<pubDate>Sun, 17 Oct 2010 18:28:57 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-9706</guid>
		<description>Currently helping some folks to set up a social networking startup from scratch. Commercially oriented. May run into OLAP issues soon. Anyway, there&#039;s never too many ways to mine data in a content graph. (Thinking broadly about human comms in general here.) email me if interested to collaborate.</description>
		<content:encoded><![CDATA[<p>Currently helping some folks to set up a social networking startup from scratch. Commercially oriented. May run into OLAP issues soon. Anyway, there&#8217;s never too many ways to mine data in a content graph. (Thinking broadly about human comms in general here.) email me if interested to collaborate.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Yves</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4645</link>
		<dc:creator>Yves</dc:creator>
		<pubDate>Fri, 07 Aug 2009 18:57:07 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4645</guid>
		<description>Simply amazing.</description>
		<content:encoded><![CDATA[<p>Simply amazing.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Trabayo &#187; Blog Archive &#187; Directed Edge auf Techcrunch</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4644</link>
		<dc:creator>Trabayo &#187; Blog Archive &#187; Directed Edge auf Techcrunch</dc:creator>
		<pubDate>Fri, 07 Aug 2009 13:17:02 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4644</guid>
		<description>[...] Ähnlichkeiten und Verbindungen zwischen Elementen. Und das ziemlich schnell: Sie haben dafür eine eigene Datenbank entwickelt. Weil alle anderen einfach nicht schnell genug [...]</description>
		<content:encoded><![CDATA[<p>[...] Ähnlichkeiten und Verbindungen zwischen Elementen. Und das ziemlich schnell: Sie haben dafür eine eigene Datenbank entwickelt. Weil alle anderen einfach nicht schnell genug [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Webã¯ç²æ¾ãªãæ¤ç´¢ãããç²¾åº¦ã®è¯ããæ¨å¥¨ãã«</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4643</link>
		<dc:creator>Webã¯ç²æ¾ãªãæ¤ç´¢ãããç²¾åº¦ã®è¯ããæ¨å¥¨ãã«</dc:creator>
		<pubDate>Fri, 07 Aug 2009 04:27:26 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4643</guid>
		<description>[...] Wheelerによれば、それが可能なのは自家製のグラフ型データベースを使うからで、既存の商用データベース〔多くが関係データベース〕では必要な速度が得られない。Directed EdgeもLindenのように、Webは検索から推奨に移行すると信じている。そしてそのためにはリアルタイム性が必須だ。リアルタイムWebは今ソーシャルの方面で離陸したばかりだが、やがてWeb全体に広まるとWheelerは考えている。&#8221;その移行はすでに起きつつあると思う。うちは、その大波に乗るとともに大波の一つでありたい&#8220;、とWheelerは言っている。 [...]</description>
		<content:encoded><![CDATA[<p>[...] Wheelerによれば、それが可能なのは自家製のグラフ型データベースを使うからで、既存の商用データベース〔多くが関係データベース〕では必要な速度が得られない。Directed EdgeもLindenのように、Webは検索から推奨に移行すると信じている。そしてそのためにはリアルタイム性が必須だ。リアルタイムWebは今ソーシャルの方面で離陸したばかりだが、やがてWeb全体に広まるとWheelerは考えている。&#8221;その移行はすでに起きつつあると思う。うちは、その大波に乗るとともに大波の一つでありたい&#8220;、とWheelerは言っている。 [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: YC-Funded Directed Edge Sees A Post-Search Web Where Recommendations Rule</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4642</link>
		<dc:creator>YC-Funded Directed Edge Sees A Post-Search Web Where Recommendations Rule</dc:creator>
		<pubDate>Thu, 06 Aug 2009 09:11:36 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4642</guid>
		<description>[...] of the graph database they created in-house after they realized the off-the-shelf options just weren&#8217;t good enough for what they wanted to do. And much like Linden&#8217;s quote, Directed Edge truly believes that [...]</description>
		<content:encoded><![CDATA[<p>[...] of the graph database they created in-house after they realized the off-the-shelf options just weren&#8217;t good enough for what they wanted to do. And much like Linden&#8217;s quote, Directed Edge truly believes that [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Scott Wheeler</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4641</link>
		<dc:creator>Scott Wheeler</dc:creator>
		<pubDate>Mon, 03 Aug 2009 17:01:06 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4641</guid>
		<description>@didroe – It’s something I’ve thought of, but there’s no scheme for it yet. In practice hot blocks end up being in disk cache, so the primary advantage would be in having a higher percentage of the actual working set in the set of cached disk pages. Unfortunately the working set being used for recommendations doesn’t necessarily correlate to the simple link structure, so an optimization would probably do better to reorder blocks based on measured access patterns.</description>
		<content:encoded><![CDATA[<p>@didroe – It’s something I’ve thought of, but there’s no scheme for it yet. In practice hot blocks end up being in disk cache, so the primary advantage would be in having a higher percentage of the actual working set in the set of cached disk pages. Unfortunately the working set being used for recommendations doesn’t necessarily correlate to the simple link structure, so an optimization would probably do better to reorder blocks based on measured access patterns.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: didroe</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4640</link>
		<dc:creator>didroe</dc:creator>
		<pubDate>Mon, 03 Aug 2009 16:42:17 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4640</guid>
		<description>Do you worry about data locality? It seems to me that it would make a big difference if the things you are linking to (sinks) are in the same data block as the things that link to them (sources). Do you have a scheme for that or is that not really an issue?</description>
		<content:encoded><![CDATA[<p>Do you worry about data locality? It seems to me that it would make a big difference if the things you are linking to (sinks) are in the same data block as the things that link to them (sources). Do you have a scheme for that or is that not really an issue?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: spenser</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4637</link>
		<dc:creator>spenser</dc:creator>
		<pubDate>Sat, 27 Jun 2009 09:32:42 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4637</guid>
		<description>Nice read.

Now I have to go find where I stashed my copy of this thing.

Yep, did just about this exact thing in 2003 or so. This was just the reminder I needed. :D</description>
		<content:encoded><![CDATA[<p>Nice read.</p>
<p>Now I have to go find where I stashed my copy of this thing.</p>
<p>Yep, did just about this exact thing in 2003 or so. This was just the reminder I needed. <img src='http://blog.directededge.com/wp-includes/images/smilies/icon_biggrin.gif' alt=':D' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Nicolas</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4638</link>
		<dc:creator>Nicolas</dc:creator>
		<pubDate>Thu, 25 Jun 2009 17:35:53 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4638</guid>
		<description>Hey
Great article. At which level do you deal with users rights and authorizations ? And is this consistent with security matters ?</description>
		<content:encoded><![CDATA[<p>Hey<br />
Great article. At which level do you deal with users rights and authorizations ? And is this consistent with security matters ?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Should you go Beyond Relational Databases?&#160;&#124;&#160;Think Vitamin</title>
		<link>http://blog.directededge.com/2009/02/27/on-building-a-stupidly-fast-graph-database/comment-page-1/#comment-4639</link>
		<dc:creator>Should you go Beyond Relational Databases?&#160;&#124;&#160;Think Vitamin</dc:creator>
		<pubDate>Wed, 24 Jun 2009 21:17:16 +0000</pubDate>
		<guid isPermaLink="false">http://blog.directededge.com/?p=175#comment-4639</guid>
		<description>[...] (which typically uses MySQL or PostgreSQL as storage back-end) are ones to look at. FreeBase and DirectedEdge have developed graph databases for their internal [...]</description>
		<content:encoded><![CDATA[<p>[...] (which typically uses MySQL or PostgreSQL as storage back-end) are ones to look at. FreeBase and DirectedEdge have developed graph databases for their internal [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>

