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

Re: Links and graphs

From: (wrong string) čius <martynas@graphity.org>
Date: Sun, 10 Nov 2013 22:11:07 +0100
Message-ID: <CAE35Vmy7gbs91N-qn4uuSc55m_o6WF_JS9U+My8C-E0zjVvKNQ@mail.gmail.com>
To: "Haq, Salman" <Salman.Haq@neustar.biz>
Cc: "public-ldp@w3.org" <public-ldp@w3.org>

you probably should take a look at SPARQL instead/as well:

And what do you mean with "descendants"? RDF is a graph, not a tree like XML.


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 Sunday, 10 November 2013 21:11:35 UTC

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