W3C home > Mailing lists > Public > semantic-web@w3.org > October 2014

Re: DBpedia now available as triple pattern fragments

From: Eric Prud'hommeaux <eric@w3.org>
Date: Wed, 29 Oct 2014 06:25:08 -0700
Message-ID: <CANfjZH3TchnpsWAjeRCb=Hu0WjzHXq1sHsrDzz4V84qDiLstvw@mail.gmail.com>
To: Ruben Verborgh <ruben.verborgh@ugent.be>
Cc: semantic-web <semantic-web@w3.org>
On Oct 29, 2014 1:42 AM, "Ruben Verborgh" <ruben.verborgh@ugent.be> wrote:
>
> Dear DBpedia enthusiasts,
>
> DBpedia is perhaps the most widely known Linked Data source on the Web.
> You can use DBpedia in a variety of ways: by querying the SPARQL endpoint,
> by browsing Linked Data documents, or by downloading one of the data
dumps.
> Access to all of these data sources is offered free of charge.
>
> Last week, a fourth way of accessing DBpedia became publicly available:
> DBpedia's triple pattern fragments at http://fragments.dbpedia.org/.
> This interface offers a different balance of trade-offs:
> it maximizes the availability of DBpedia by offering a simple server
> and thus moving SPARQL query execution to the client side.
> Queries will execute slower than on the public SPARQL endpoint,
> but their execution should be possible close to 100% of the time.
>
> Here are some fun things to try:
> - browse the new interface:
http://fragments.dbpedia.org/2014/en?object=dbpedia%3ALinked_Data
> - make your browser execute a SPARQL query: http://fragments.dbpedia.org/
> - add live queries to your application:
https://github.com/LinkedDataFragments/Client.js#using-the-library
>
> Learn all about triple pattern fragments at the Linked Data Fragments
website
> http://linkeddatafragments.org/, the ISWC2014 paperhttp://
linkeddatafragments.org/publications/iswc2014.pdf,

This looks really cool! I'd like to understand the current limitations. The
above doc describes paging over "blank-node-free" triples. Is that to
simplify ordering? Would it also work with a deeper ordering like dbooth et
al have discussed on semantic-web?

> and ISWC2014 slides:
http://www.slideshare.net/RubenVerborgh/querying-datasets-on-the-web-with-high-availability
.

The slides mention improved cache hits. These cache effectively move some
of your working result set into http-level (and thus sharable, if multiple
clients happen to ask overlapping queries) caches. Have to poked at what
happens when to make the unit of exchange a cannonicalized graph pattern
instead of just a triple pattern? (I note that your slides say "go play" so
maybe that's up to us.)

> We wish you a nice time with this new DBpedia interface!
>
> Best regards,
>
> Ruben
Received on Wednesday, 29 October 2014 13:25:38 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 19:49:26 UTC