<?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 for Marko A. Rodriguez</title>
	<atom:link href="http://markorodriguez.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://markorodriguez.com</link>
	<description>Supporting the Emerging Graph Landscape</description>
	<lastBuildDate>Wed, 23 May 2012 09:33:13 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>Comment on A TinkerPop Story by victor</title>
		<link>http://markorodriguez.com/2011/12/12/a-tinkerpop-story/#comment-437</link>
		<dc:creator><![CDATA[victor]]></dc:creator>
		<pubDate>Wed, 23 May 2012 09:33:13 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1676#comment-437</guid>
		<description><![CDATA[Very nice story indeed. The platform is also very elegantly defined.

But I feel an important thing is missing - it is the time axis. Some facts are temporary by nature and don&#039;t stay truth forever, same with relationships. To some degree one can manage this by keeping timestamps and time periods in corresponding properties associated with everything, but I feel it will be more natural if the time component is somehow managed by the Graph platform so it has an intrinsic notion of time. This will allow to keep &quot;versions&quot; of the graph and to analyze its evolution over time.]]></description>
		<content:encoded><![CDATA[<p>Very nice story indeed. The platform is also very elegantly defined.</p>
<p>But I feel an important thing is missing &#8211; it is the time axis. Some facts are temporary by nature and don&#8217;t stay truth forever, same with relationships. To some degree one can manage this by keeping timestamps and time periods in corresponding properties associated with everything, but I feel it will be more natural if the time component is somehow managed by the Graph platform so it has an intrinsic notion of time. This will allow to keep &#8220;versions&#8221; of the graph and to analyze its evolution over time.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Graphs, Brains, and Gremlin by Structural Abstractions in Brains and Graphs &#171; Aurelius</title>
		<link>http://markorodriguez.com/2011/07/14/graphs-brains-and-gremlin/#comment-435</link>
		<dc:creator><![CDATA[Structural Abstractions in Brains and Graphs &#171; Aurelius]]></dc:creator>
		<pubDate>Tue, 08 May 2012 16:38:26 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1147#comment-435</guid>
		<description><![CDATA[[...] M.A., &#8220;Graphs, Brains, and Gremlin,&#8221; Marko A. Rodriguez&#8217;s WordPress Blog, July [...]]]></description>
		<content:encoded><![CDATA[<p>[...] M.A., &#8220;Graphs, Brains, and Gremlin,&#8221; Marko A. Rodriguez&#8217;s WordPress Blog, July [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Exploring Wikipedia with Gremlin Graph Traversals by Marko A. Rodriguez</title>
		<link>http://markorodriguez.com/2012/03/07/exploring-wikipedia-with-gremlin-graph-traversals/#comment-428</link>
		<dc:creator><![CDATA[Marko A. Rodriguez]]></dc:creator>
		<pubDate>Thu, 29 Mar 2012 16:01:04 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1850#comment-428</guid>
		<description><![CDATA[Hello,

Most natural graphs/networks have a similar degree distribution. In other words, natural graphs have mostly vertices with a low-degree and very few vertices with a high-degree. To figure out which vertex has the highest in (or out) degree, you can simply do:

[sourcecode language=&quot;groovy&quot; wraplines=&quot;false&quot;]
vertex = null; degree = 0;
g.V.sideEffect{d = it.out.count(); if(d &gt; degree) {vertex = it; degree = d}}
[/sourcecode]

You can get fancy with that code motif to get the top 10, etc. 

Thanks for reading,
Marko.

http://markorodriguez.com]]></description>
		<content:encoded><![CDATA[<p>Hello,</p>
<p>Most natural graphs/networks have a similar degree distribution. In other words, natural graphs have mostly vertices with a low-degree and very few vertices with a high-degree. To figure out which vertex has the highest in (or out) degree, you can simply do:</p>
<pre class="brush: groovy; wrap-lines: false;">
vertex = null; degree = 0;
g.V.sideEffect{d = it.out.count(); if(d &gt; degree) {vertex = it; degree = d}}
</pre>
<p>You can get fancy with that code motif to get the top 10, etc. </p>
<p>Thanks for reading,<br />
Marko.</p>
<p><a href="http://markorodriguez.com" rel="nofollow">http://markorodriguez.com</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Exploring Wikipedia with Gremlin Graph Traversals by gcbenison</title>
		<link>http://markorodriguez.com/2012/03/07/exploring-wikipedia-with-gremlin-graph-traversals/#comment-427</link>
		<dc:creator><![CDATA[gcbenison]]></dc:creator>
		<pubDate>Thu, 29 Mar 2012 15:54:36 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1850#comment-427</guid>
		<description><![CDATA[Very interesting to see the in- and out- degree distributions for Wikipedia.  The most common in-degree is just one! What are those few articles that have in-degrees in the millions?]]></description>
		<content:encoded><![CDATA[<p>Very interesting to see the in- and out- degree distributions for Wikipedia.  The most common in-degree is just one! What are those few articles that have in-degrees in the millions?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Exploring Wikipedia with Gremlin Graph Traversals by Marko A. Rodriguez</title>
		<link>http://markorodriguez.com/2012/03/07/exploring-wikipedia-with-gremlin-graph-traversals/#comment-424</link>
		<dc:creator><![CDATA[Marko A. Rodriguez]]></dc:creator>
		<pubDate>Sun, 25 Mar 2012 19:03:36 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1850#comment-424</guid>
		<description><![CDATA[You can find the raw data dumps at the DBPedia project&#039;s download page: http://wiki.dbpedia.org/Downloads37. Enjoy.]]></description>
		<content:encoded><![CDATA[<p>You can find the raw data dumps at the DBPedia project&#8217;s download page: <a href="http://wiki.dbpedia.org/Downloads37" rel="nofollow">http://wiki.dbpedia.org/Downloads37</a>. Enjoy.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Exploring Wikipedia with Gremlin Graph Traversals by infojunkie71</title>
		<link>http://markorodriguez.com/2012/03/07/exploring-wikipedia-with-gremlin-graph-traversals/#comment-423</link>
		<dc:creator><![CDATA[infojunkie71]]></dc:creator>
		<pubDate>Sun, 25 Mar 2012 05:23:36 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1850#comment-423</guid>
		<description><![CDATA[Fascinating article, as usual. Is there a way to get access to the DBPedia files to reproduce these experiments?]]></description>
		<content:encoded><![CDATA[<p>Fascinating article, as usual. Is there a way to get access to the DBPedia files to reproduce these experiments?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Exploring Wikipedia with Gremlin Graph Traversals by Exploring Wikipedia with Gremlin Graph Traversals &#171; Another Word For It</title>
		<link>http://markorodriguez.com/2012/03/07/exploring-wikipedia-with-gremlin-graph-traversals/#comment-406</link>
		<dc:creator><![CDATA[Exploring Wikipedia with Gremlin Graph Traversals &#171; Another Word For It]]></dc:creator>
		<pubDate>Sun, 11 Mar 2012 01:22:30 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1850#comment-406</guid>
		<description><![CDATA[[...] Exploring Wikipedia with Gremlin Graph Traversals by Marko Rodriguez. [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Exploring Wikipedia with Gremlin Graph Traversals by Marko Rodriguez. [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on On the Nature of Pipes by Jogger: almost like named_scopes &#171; Another Word For It</title>
		<link>http://markorodriguez.com/2011/08/03/on-the-nature-of-pipes/#comment-398</link>
		<dc:creator><![CDATA[Jogger: almost like named_scopes &#171; Another Word For It]]></dc:creator>
		<pubDate>Mon, 05 Mar 2012 00:15:54 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1365#comment-398</guid>
		<description><![CDATA[[...] Remember the named_scopes from back in the days when you were using rails? Jogger gives you named traversals and is a little bit like named scopes. Jogger groups multiple pacer traversals together and give them a name. Pacer traversals are are like pipes. What are pipes? Pipes are great!! [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Remember the named_scopes from back in the days when you were using rails? Jogger gives you named traversals and is a little bit like named scopes. Jogger groups multiple pacer traversals together and give them a name. Pacer traversals are are like pipes. What are pipes? Pipes are great!! [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A TinkerPop Story by Tom Carchrae</title>
		<link>http://markorodriguez.com/2011/12/12/a-tinkerpop-story/#comment-394</link>
		<dc:creator><![CDATA[Tom Carchrae]]></dc:creator>
		<pubDate>Thu, 16 Feb 2012 16:39:30 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1676#comment-394</guid>
		<description><![CDATA[That was an awesome and very entertaining overview!   I&#039;m looking forward to playing in TinkerPop land.  Thank you for instigating and creating.]]></description>
		<content:encoded><![CDATA[<p>That was an awesome and very entertaining overview!   I&#8217;m looking forward to playing in TinkerPop land.  Thank you for instigating and creating.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on A TinkerPop Story by John Brown</title>
		<link>http://markorodriguez.com/2011/12/12/a-tinkerpop-story/#comment-393</link>
		<dc:creator><![CDATA[John Brown]]></dc:creator>
		<pubDate>Mon, 13 Feb 2012 07:23:42 +0000</pubDate>
		<guid isPermaLink="false">http://markorodriguez.com/?p=1676#comment-393</guid>
		<description><![CDATA[Perhaps Gremlins cousin Gizmo is toiling in the TinkerPop with a new looking glass of relative awareness calibrated to the individual graphical perspective of each conceptual thing, capable of facilitating an instantaeous blue paint can click on the blueprints.  Will the paint burst the pipes, spill out of the frames and splash onto gremlins head in echoing laughter?]]></description>
		<content:encoded><![CDATA[<p>Perhaps Gremlins cousin Gizmo is toiling in the TinkerPop with a new looking glass of relative awareness calibrated to the individual graphical perspective of each conceptual thing, capable of facilitating an instantaeous blue paint can click on the blueprints.  Will the paint burst the pipes, spill out of the frames and splash onto gremlins head in echoing laughter?</p>
]]></content:encoded>
	</item>
</channel>
</rss>

