<?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 Trueg&#039;s Blog</title>
	<atom:link href="http://trueg.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://trueg.wordpress.com</link>
	<description>Semantic Desktop - Wha?</description>
	<lastBuildDate>Tue, 17 Nov 2009 08:24:51 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Virtuoso &#8211; Once More With Feeling by Sebastian Trüg</title>
		<link>http://trueg.wordpress.com/2009/10/22/virtuoso-once-more-with-feeling/#comment-713</link>
		<dc:creator>Sebastian Trüg</dc:creator>
		<pubDate>Tue, 17 Nov 2009 08:24:51 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=201#comment-713</guid>
		<description>I added a little hint to the cmake output</description>
		<content:encoded><![CDATA[<p>I added a little hint to the cmake output</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Virtuoso &#8211; Once More With Feeling by Andras</title>
		<link>http://trueg.wordpress.com/2009/10/22/virtuoso-once-more-with-feeling/#comment-711</link>
		<dc:creator>Andras</dc:creator>
		<pubDate>Sun, 15 Nov 2009 20:09:30 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=201#comment-711</guid>
		<description>The checks are not good enough IMO, it doesn&#039;t say what you need. Yes, Step3 contains I need iodbc, but if I don&#039;t read this blog, I wound&#039;t know from the cmake output.</description>
		<content:encoded><![CDATA[<p>The checks are not good enough IMO, it doesn&#8217;t say what you need. Yes, Step3 contains I need iodbc, but if I don&#8217;t read this blog, I wound&#8217;t know from the cmake output.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Virtuoso &#8211; Once More With Feeling by Ryan Rix</title>
		<link>http://trueg.wordpress.com/2009/10/22/virtuoso-once-more-with-feeling/#comment-706</link>
		<dc:creator>Ryan Rix</dc:creator>
		<pubDate>Tue, 03 Nov 2009 15:30:08 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=201#comment-706</guid>
		<description>The packages for Fedora in kde-redhat unstable (built by Rex Dieter) require the same thing to be done.</description>
		<content:encoded><![CDATA[<p>The packages for Fedora in kde-redhat unstable (built by Rex Dieter) require the same thing to be done.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on SPARQL is weird&#8230; by Ivan Mikhailov</title>
		<link>http://trueg.wordpress.com/2009/10/26/sparql-is-weird/#comment-704</link>
		<dc:creator>Ivan Mikhailov</dc:creator>
		<pubDate>Thu, 29 Oct 2009 18:58:33 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=205#comment-704</guid>
		<description>bif:exists() may be faster than OPTIONAL... FILTER() or may be slower. When the query is simple enough the optimizer will find full set of possible execution plans for any of these notations and these sets will be identical, so the best plan found will be the same for both variants. When the query is complicated enough (and number of execution plans grow exponentially), the compiler will evaluate some subset of whole set of plans starting from different points (left outer join in case of OPTIONAL...FILTER() and &quot;straightforward&quot; subselect for bif:exists()). Substs will usually intersect and at least some execution plains in the intersection are usually very good, but some plans outside the intersection might be just perfect, so the notation works as a &quot;fine tuning&quot; for the optimizer.

With usual settings, &quot;query is complicated enough&quot; means &quot;one page long&quot; for SPARQL on RDF data or &quot;half page long&quot; for sophisticated SPARQL-BI on RDF Views.</description>
		<content:encoded><![CDATA[<p>bif:exists() may be faster than OPTIONAL&#8230; FILTER() or may be slower. When the query is simple enough the optimizer will find full set of possible execution plans for any of these notations and these sets will be identical, so the best plan found will be the same for both variants. When the query is complicated enough (and number of execution plans grow exponentially), the compiler will evaluate some subset of whole set of plans starting from different points (left outer join in case of OPTIONAL&#8230;FILTER() and &#8220;straightforward&#8221; subselect for bif:exists()). Substs will usually intersect and at least some execution plains in the intersection are usually very good, but some plans outside the intersection might be just perfect, so the notation works as a &#8220;fine tuning&#8221; for the optimizer.</p>
<p>With usual settings, &#8220;query is complicated enough&#8221; means &#8220;one page long&#8221; for SPARQL on RDF data or &#8220;half page long&#8221; for sophisticated SPARQL-BI on RDF Views.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Just another way of browsing your files by mxttie</title>
		<link>http://trueg.wordpress.com/2009/10/26/just-another-way-of-browsing-your-files/#comment-703</link>
		<dc:creator>mxttie</dc:creator>
		<pubDate>Thu, 29 Oct 2009 15:22:05 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=207#comment-703</guid>
		<description>timeslider =&gt; exactly my thoughts! i would certainly use such functionality (and also being able to specify a root folder from where you want to search)</description>
		<content:encoded><![CDATA[<p>timeslider =&gt; exactly my thoughts! i would certainly use such functionality (and also being able to specify a root folder from where you want to search)</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on And Yet Another Post About Virtuoso by VOS Maintainer</title>
		<link>http://trueg.wordpress.com/2009/10/14/and-yet-another-post-about-virtuoso/#comment-702</link>
		<dc:creator>VOS Maintainer</dc:creator>
		<pubDate>Wed, 28 Oct 2009 12:31:59 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=195#comment-702</guid>
		<description>Documentation on how to extract ODBC meta information on the RDF result is now available from the online documentation:

http://docs.openlinksw.com/virtuoso/virtodbcsparql.html</description>
		<content:encoded><![CDATA[<p>Documentation on how to extract ODBC meta information on the RDF result is now available from the online documentation:</p>
<p><a href="http://docs.openlinksw.com/virtuoso/virtodbcsparql.html" rel="nofollow">http://docs.openlinksw.com/virtuoso/virtodbcsparql.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Just another way of browsing your files by mat69</title>
		<link>http://trueg.wordpress.com/2009/10/26/just-another-way-of-browsing-your-files/#comment-701</link>
		<dc:creator>mat69</dc:creator>
		<pubDate>Tue, 27 Oct 2009 23:02:36 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=207#comment-701</guid>
		<description>Great job!

Though it cannot create the ioslave here, it reports an error when loading kio_timeline. Do I also have to recompile some other components?</description>
		<content:encoded><![CDATA[<p>Great job!</p>
<p>Though it cannot create the ioslave here, it reports an error when loading kio_timeline. Do I also have to recompile some other components?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Just another way of browsing your files by Khashayar</title>
		<link>http://trueg.wordpress.com/2009/10/26/just-another-way-of-browsing-your-files/#comment-699</link>
		<dc:creator>Khashayar</dc:creator>
		<pubDate>Tue, 27 Oct 2009 15:39:58 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=207#comment-699</guid>
		<description>Brilliant!</description>
		<content:encoded><![CDATA[<p>Brilliant!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Just another way of browsing your files by Sebastian Trüg</title>
		<link>http://trueg.wordpress.com/2009/10/26/just-another-way-of-browsing-your-files/#comment-698</link>
		<dc:creator>Sebastian Trüg</dc:creator>
		<pubDate>Tue, 27 Oct 2009 08:42:26 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=207#comment-698</guid>
		<description>That would be way better. But it would be done using the same KIO slave I suppose.</description>
		<content:encoded><![CDATA[<p>That would be way better. But it would be done using the same KIO slave I suppose.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Just another way of browsing your files by Sebastian Trüg</title>
		<link>http://trueg.wordpress.com/2009/10/26/just-another-way-of-browsing-your-files/#comment-697</link>
		<dc:creator>Sebastian Trüg</dc:creator>
		<pubDate>Tue, 27 Oct 2009 08:34:06 +0000</pubDate>
		<guid isPermaLink="false">http://trueg.wordpress.com/?p=207#comment-697</guid>
		<description>It is perfectly possible to create a GUI which provides a timeslider. It is probably even very simple. Does someone want to step up? I think this is a nice way of getting into Nepomuk development.</description>
		<content:encoded><![CDATA[<p>It is perfectly possible to create a GUI which provides a timeslider. It is probably even very simple. Does someone want to step up? I think this is a nice way of getting into Nepomuk development.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
