- From: Ruben Verborgh <ruben.verborgh@ugent.be>
- Date: Tue, 11 Mar 2014 12:39:32 +0000
- To: Alfredo Serafini <seralf@gmail.com>
- Cc: public-lod Data <public-lod@w3.org>, "semantic-web@w3.org Web" <semantic-web@w3.org>
Hi Alfredo, > I was looking for some library who decompose queries in order to maximise triples re-using. If I am not wrong is what you are doing here? That is indeed what we are doing! The algorithm is detailed in our paper [1], a high-level overview is given online [2]. > Most of of all I am curious about the methods: do you propose this approach as a pattern more than a technologic solution? It certainly is a pattern, a strategy for offering data in a scalable and queryable way. Right now, there is one server that offers a specific kind of fragments (basic Linked Data Fragments). However, we envision in the future that servers offer many different kinds of fragments [3]; essentially, those fragments that they can generate easily. Clients can then decide which kinds of fragments they like to use for the task they need to perform. This task could be answering a SPARQL query, but also more application-specific scenarios. That's the interesting thing about fragments: they can be reused serendipitously in many ways. > If I undertand correctly the idea, this seems to me great, and can be expanded in many ways, maybe also introducing a sort of "linked hypermedia" layer. It currently functions as a hypermedia API; that is, all fragments link to each other and the client uses hypermedia [4] to navigate from one fragment to another (instead of pre-existing URL rules). Best, Ruben [1] http://linkeddatafragments.org/publications/ldow2014.pdf [2] http://ruben.verborgh.org/blog/2014/03/11/towards-web-scale-web-querying/#querying-with-linked-data-fragments [3] http://linkeddatafragments.org/in-depth/#ldp [4] https://github.com/LinkedDataFragments/Client/blob/master/lib/LinkedDataFragmentsClient.js#L33
Received on Tuesday, 11 March 2014 12:40:06 UTC