<?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: Approaches to Publishing Linked Data via Named Graphs</title>
	<atom:link href="http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/</link>
	<description>A journal of no fixed aims or direction, by Leigh Dodds</description>
	<lastBuildDate>Fri, 10 Dec 2010 14:02:04 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: admin</title>
		<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/comment-page-1/#comment-393</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Mon, 21 Dec 2009 15:59:59 +0000</pubDate>
		<guid isPermaLink="false">http://www.ldodds.com/blog/?p=386#comment-393</guid>
		<description>Hi Michael,

Thanks for the pointer I&#039;ll take a look at the paper. I&#039;ve read your recent blog posts about RDF &amp; REST as its an area that I&#039;m particularly interested in: the two are very well aligned in my view.

Cheers,

L.</description>
		<content:encoded><![CDATA[<p>Hi Michael,</p>
<p>Thanks for the pointer I&#8217;ll take a look at the paper. I&#8217;ve read your recent blog posts about RDF &amp; REST as its an area that I&#8217;m particularly interested in: the two are very well aligned in my view.</p>
<p>Cheers,</p>
<p>L.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: admin</title>
		<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/comment-page-1/#comment-392</link>
		<dc:creator>admin</dc:creator>
		<pubDate>Mon, 21 Dec 2009 15:58:30 +0000</pubDate>
		<guid isPermaLink="false">http://www.ldodds.com/blog/?p=386#comment-392</guid>
		<description>Hi Benji,

Thanks for the comment, that&#039;s another interesting variant and one that I hadn&#039;t considered. 

L.</description>
		<content:encoded><![CDATA[<p>Hi Benji,</p>
<p>Thanks for the comment, that&#8217;s another interesting variant and one that I hadn&#8217;t considered. </p>
<p>L.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Benjamin Nowack</title>
		<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/comment-page-1/#comment-391</link>
		<dc:creator>Benjamin Nowack</dc:creator>
		<pubDate>Mon, 21 Dec 2009 08:27:01 +0000</pubDate>
		<guid isPermaLink="false">http://www.ldodds.com/blog/?p=386#comment-391</guid>
		<description>Hi Leigh,

I&#039;m generally using multiple graphs per resource, where each graph is associated with a certain front-end operation, e.g. the &quot;basic details&quot;-form for resource  writes into graph , the &quot;friends&quot;-manager saves data in , interests go into  etc. 

This requires a graph look-up when a resource is going to be deleted, but it makes managing sub-chunks of a resource description quite hassle-free. I can simply replace the respective graph w/o messing with the data that&#039;s meant to be kept.

Caching and RDF serving is then based on the resource view (which is built from multiple graphs), i.e. a new, app-specific graph is exposed to consuming applications.

To support the larger number of graphs backend-wise, I&#039;ve normalized/separated the &quot;graph&quot; URI from the triple parts so that typical/non-graph queries can work with a compact triple table. On the down-side, certain GRAPH patterns (e.g. in OPTIONALs) become rather painful due to the larger number of table joins.</description>
		<content:encoded><![CDATA[<p>Hi Leigh,</p>
<p>I&#8217;m generally using multiple graphs per resource, where each graph is associated with a certain front-end operation, e.g. the &#8220;basic details&#8221;-form for resource  writes into graph , the &#8220;friends&#8221;-manager saves data in , interests go into  etc. </p>
<p>This requires a graph look-up when a resource is going to be deleted, but it makes managing sub-chunks of a resource description quite hassle-free. I can simply replace the respective graph w/o messing with the data that&#8217;s meant to be kept.</p>
<p>Caching and RDF serving is then based on the resource view (which is built from multiple graphs), i.e. a new, app-specific graph is exposed to consuming applications.</p>
<p>To support the larger number of graphs backend-wise, I&#8217;ve normalized/separated the &#8220;graph&#8221; URI from the triple parts so that typical/non-graph queries can work with a compact triple table. On the down-side, certain GRAPH patterns (e.g. in OPTIONALs) become rather painful due to the larger number of table joins.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Michael Hausenblas</title>
		<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/comment-page-1/#comment-386</link>
		<dc:creator>Michael Hausenblas</dc:creator>
		<pubDate>Sun, 20 Dec 2009 14:07:43 +0000</pubDate>
		<guid isPermaLink="false">http://www.ldodds.com/blog/?p=386#comment-386</guid>
		<description>Thanks for this Leigh, very valuable write-up! I agree, it&#039;s an important issue and we should start collecting good practices. Note that we&#039;ve recently looked into this issue as well (http://sw-app.org/pub/restful-sparql.pdf) 

Cheers,
Michael</description>
		<content:encoded><![CDATA[<p>Thanks for this Leigh, very valuable write-up! I agree, it&#8217;s an important issue and we should start collecting good practices. Note that we&#8217;ve recently looked into this issue as well (<a href="http://sw-app.org/pub/restful-sparql.pdf" rel="nofollow">http://sw-app.org/pub/restful-sparql.pdf</a>) </p>
<p>Cheers,<br />
Michael</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: uberVU - social comments</title>
		<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/comment-page-1/#comment-385</link>
		<dc:creator>uberVU - social comments</dc:creator>
		<pubDate>Sun, 20 Dec 2009 13:47:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.ldodds.com/blog/?p=386#comment-385</guid>
		<description>&lt;strong&gt;Social comments and analytics for this post...&lt;/strong&gt;

This post was mentioned on Twitter by ldodds: New blog post: Approaches to Publishing Linked Data via Named Graphs. http://bit.ly/6ZspJH #rdf #linkeddata #REST...</description>
		<content:encoded><![CDATA[<p><strong>Social comments and analytics for this post&#8230;</strong></p>
<p>This post was mentioned on Twitter by ldodds: New blog post: Approaches to Publishing Linked Data via Named Graphs. <a href="http://bit.ly/6ZspJH" rel="nofollow">http://bit.ly/6ZspJH</a> #rdf #linkeddata #REST&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Justin Cormack</title>
		<link>http://www.ldodds.com/blog/2009/12/approaches-to-publishing-linked-data-via-named-graphs/comment-page-1/#comment-384</link>
		<dc:creator>Justin Cormack</dc:creator>
		<pubDate>Sun, 20 Dec 2009 13:37:19 +0000</pubDate>
		<guid isPermaLink="false">http://www.ldodds.com/blog/?p=386#comment-384</guid>
		<description>I have been thinking about the first case in fairly similar terms for a while. A queue based model with eventual consistency has also been my preferred choice, although I think you may need to build up more general collection objects than full triplestores to efficiently answer specific queries.

I am glad there is some recognition in the W3C now that it is necessary to talk about RDF and SPARQL outside a pure document context and recognize that the (only significant) use case is on the web and issues about REST, the resource model and updates matter. We need to get away from Prolog in XML to get stuff used.</description>
		<content:encoded><![CDATA[<p>I have been thinking about the first case in fairly similar terms for a while. A queue based model with eventual consistency has also been my preferred choice, although I think you may need to build up more general collection objects than full triplestores to efficiently answer specific queries.</p>
<p>I am glad there is some recognition in the W3C now that it is necessary to talk about RDF and SPARQL outside a pure document context and recognize that the (only significant) use case is on the web and issues about REST, the resource model and updates matter. We need to get away from Prolog in XML to get stuff used.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

