- From: John Arwe <johnarwe@us.ibm.com>
- Date: Mon, 11 Nov 2013 08:16:28 -0500
- To: "public-ldp@w3.org" <public-ldp@w3.org>
- Message-ID: <OF3528AC3D.EDC49971-ON85257C20.0048C14B-85257C20.0048EBCB@us.ibm.com>
LDP does not define any query syntax(es). It defers to other existing standards of the implementation's choice; SPARQL query would be a natural one for RDF stores. LDP does not define any way for clients to influence paging. Best Regards, John Voice US 845-435-9470 BluePages Tivoli OSLC Lead - Show me the Scenario "Haq, Salman" <Salman.Haq@neustar.biz> wrote on 11/07/2013 02:38:57 PM: > From: "Haq, Salman" <Salman.Haq@neustar.biz> > To: "public-ldp@w3.org" <public-ldp@w3.org>, > Date: 11/10/2013 12:29 PM > Subject: Re: Links and graphs > > Apologies about reviving such an old thread. > > Given an RDF graph and LDP, how can one query for all nodes that are > descendants of node :A? > > In the query, how can one specify the paging size for the number of > resources to be returned? > > In the query, how can one specify which properties to return? > > Lastly, how can one specify which object property to following when > traversing the graph? > > Thanks, > Shaq
Received on Monday, 11 November 2013 13:17:42 UTC