W3C home > Mailing lists > Public > public-ldp-wg@w3.org > November 2013

Re: ldp-ISSUE-90 (Named Graph): An LDPC/LDPR is a Named Graph [Linked Data Platform Spec]

From: Kingsley Idehen <kidehen@openlinksw.com>
Date: Sun, 24 Nov 2013 15:29:50 -0500
Message-ID: <529261BE.50100@openlinksw.com>
To: public-ldp-wg@w3.org
On 11/24/13 6:12 AM, Henry Story wrote:
> On 23 Nov 2013, at 23:59, Ashok Malhotra<ashok.malhotra@oracle.com>  wrote:
>> >If we are brainstorming, then why not consider a URI scheme
>> >where  LDPC-URI#n retrieves the nth member of the container?
> That cannot be implemented in HTTP. A #n URI cannot be passed over HTTP.
> Requests in HTTP MUST remove the fragment identifier, before making a request.
> Henry

The following [1][2][3] hopefully illustrate Henry's point above re., 
HTTP URI based denotation (naming).

[1] http://bit.ly/17RQQXX -- name resolution protocols and their effect 
on the notion of data source names (dsns)
[2] http://bit.ly/WAJGCp -- Linked Data in a single slide
[3] http://bit.ly/15tk1Au -- HTTP URI duality, implicit indirection, and 



Kingsley Idehen	
Founder & CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter Profile: https://twitter.com/kidehen
Google+ Profile: https://plus.google.com/+KingsleyIdehen/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen

Received on Sunday, 24 November 2013 20:30:12 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 16:17:46 UTC