- From: Haq, Salman <Salman.Haq@neustar.biz>
- Date: Mon, 11 Nov 2013 14:51:17 +0000
- To: Martynas Jusevičius <martynas@graphity.org>
- CC: "public-ldp@w3.org" <public-ldp@w3.org>
Martynas, I agree that property paths and other features from SPARQL 1.1 are well suited for my use cases. But I'm trying to figure out what one gains from an LDP deployment that they won't from an RDF store backing an application. And sure, RDF is a graph but complex ontologies are often best visualized as a tree rather than a network graph. Is the expectation that a client trying to query complex ontology for rendering should submit a suitable SPARQL query? Thanks, Shaq On 11/10/13 4:11 PM, "Martynas Jusevičius" <martynas@graphity.org> wrote: >Shaq, > >you probably should take a look at SPARQL instead/as well: >http://www.w3.org/TR/sparql11-query/ > >And what do you mean with "descendants"? RDF is a graph, not a tree like >XML. > >Martynas >graphityhq.com > >On Thu, Nov 7, 2013 at 8:38 PM, Haq, Salman <Salman.Haq@neustar.biz> >wrote: >> 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 14:53:57 UTC