Linked Data Fragments

Web-Scale Querying through 
Linked Data Fragments
Ruben Verborgh Miel Vander Sande Pieter Colpaert 
Sam Coppens Erik Mannens Rik Van de Walle
Ghent University – iMinds – Multimedia Lab

What good is a 
Web of Linked Data
if we cannot 
reliably query it?

<95%
MORE THAN HALF 
of public SPARQL endpoints
AVAILABILITY
Buil-Aranda – Hogan – Umbrich – Vandenbussche 
SPARQL Web-Querying Infrastructure: Ready for Action?

WE CANNOT QUERY
public Linked Data reliably.
WE CANNOT BUILD 
applications on top of
public queryable data.

It’s not a performance issue, 
it is an architectural problem.
SPARQL Server
Client
Client
Client
Client
Client
Client
Client
(a) sparql endpoints perform all processing on the server, leading to fast
query execution with low data bandwidth, and a rapidly overloaded server.

An architectural problem 
requires an architectural solution.
LDF Server
Client
ClientClient
Client
Client
Client
Client Client
Client
(b) ldf servers only support simple requests and can thus handle far higher
loads. Clients perform the querying, so they need more (cacheable) data.

We developed an approach 
to query Linked Data 
in a scalable and reliable way 
by moving intelligence 
from the server to the client.

What Linked Data Fragments are.
How clients can execute queries.
Taking querying to the next level.

Currently, there are three ways 
to query a Linked Data set.
high server efforthigh client effort
derefer- 
encing
data 
dump
SPARQL 
endpoint
They offer fragments of a dataset.

data 
dump
SPARQL 
endpoint
Any fragment of a Linked Data set 
is called a Linked Data Fragment.
derefer- 
encing
all subject SPARQL querySELECTOR

Can we query fragments that 
balance client and server effort?
data 
dump
SPARQL 
endpoint
basic 
Linked Data 
Fragments
derefer- 
encing
all subject SPARQL querytriple pattern

A basic LDF is easy to generate 
yet enables efficient querying.
data (in pages)
basic triple pattern { ?s ?p ?o. }
metadata
count of total matches
controls
retrieve other basic LDFs

data (first 100)
controls (other basic LDFs)
metadata (total count)

How can a server publish 
basic Linked Data Fragments?
open-source server
choose your back-end
(private) SPARQL endpoint
HDT binary triple format 
Turtle file
…

How to answer this query using 
only basic Linked Data Fragments?
SELECT ?person ?city WHERE {
?person a dbpedia-owl:Artist.
?person dbpedia-owl:birthPlace ?city.
?city foaf:name "York"@en.
}

Get the corresponding fragments 
dbpedia:York foaf:name “York”@en.
dbpedia:York,_Ontario foaf:name “York”@en. 
…
dbpedia:Ganesh_Ghosh …:birthPlace dbpedia:Bengal_Presidency.
dbpedia:Jacques_L'enfant …:birthPlace dbpedia:Beauce. 
…
dbpedia:Aamir_Zaki a dbpedia-owl:Artist.
dbpedia:Ahmad_Morid a dbpedia-owl:Artist. 
…

and read the count metadata.
?person a dbpedia-owl:Artist. ±61,000
±470,000
12
…
dbpedia:Jacques_L'enfant …:birthPlace dbpedia:Beauce. 
…
…

Start with the smallest fragment. 
Start with the first match.
?person a dbpedia-owl:Artist ±61,
±470,
12
?person dbpedia-owl:birthPlace
…
dbpedia:Jacques_L'enfant …:birthPlace dbpedia:Beauce.
…
dbpedia:Aamir_Zaki
dbpedia:Ahmad_Morid a dbpedia-owl:Artist.
…

SELECT ?person WHERE {
?person dbpedia-owl:birthPlace dbpedia:York.
dbpedia:York foaf:name "York"@en.
}

?person dbpo:birthPlace dbpedia:York.
dbpedia:John_Flaxman dbpo:birthPlace dbpedia:York.
dbpedia:Joseph_Hansom dbpo:birthPlace dbpedia:York. 
…
…

?person a dbpedia-owl:Artist. ±61,000
75?person dbpo:birthPlace dbpedia:York.
…
…

Start with the smallest fragment. 
Start with the first match.
?person a dbpedia-owl:Artist ±61,
75?person dbpo:birthPlace dbpedia:York.
…
dbpedia:Aamir_Zaki
dbpedia:Ahmad_Morid a dbpedia-owl:Artist.
…

ASK {
dbp:John_Flaxman a dbpo:Artist.
dbp:John_Flaxman dbpo:birthPlace dbp:York.
dbp:York foaf:name "York"@en.
}

Get the corresponding fragment 
dbpedia:John_Flaxman a dbpedia-owl:Artist. 1
dbpedia:John_Flaxman a dbpedia-owl:Artist.
!
Output the match:
?person = dbpedia:John_Flaxman 
?city = dbpedia:York

Recursively repeat the process 
for all bindings.
?person dbpo:birthPlace dbpedia:York.
…
…

Linked Data Fragments is a vision, 
not just a single technology.
derefer- 
encing
data 
dump
SPARQL 
endpoint
basic 
Linked Data 
Fragments
How can clients query the Web 
in a scalable way?
L i n k e d D a t a F r a g m e n t s

We want to query different servers, 
withmanydifferentkindsoffragments.
derefer- 
encing
data 
dump
SPARQL 
endpoint
basic 
Linked Data 
Fragments
L i n k e d D a t a F r a g m e n t s

Find suitcases on Amazon 
and their cost.
SELECT ?label ?cost WHERE {
?suitcase schema:keywords "suitcase";
prov:wasDerivedFrom <http://amazon.com/>;
rdfs:label ?label;
schema:cost ?cost.
}

Find suitcases on Amazon 
and see how much they cost on eBay.
SELECT ?label ?costA ?costE WHERE {
?suitcaseA schema:keywords "suitcase";
prov:wasDerivedFrom <http://amazon.com/>;
rdfs:label ?label;
schema:cost ?costA.
?suitcaseE schema:keywords ?label;
prov:wasDerivedFrom <http://ebay.com/>;
schema:cost ?costE.
}

The Linked Data Fragments vision 
allows clients to query the Web.
If we want to see intelligent clients,
we must stop building intelligent servers.
Linked Data Fragments is the quest to 
design servers that enable clients to query.

All software is available 
as open source.
linkeddatafragments.org
data.linkeddatafragments.org
client.linkeddatafragments.org

linkeddatafragments.org
Ruben Verborgh Miel Vander Sande Pieter Colpaert 
Sam Coppens Erik Mannens Rik Van de Walle
Ghent University – iMinds – Multimedia Lab

Linked Data Fragments

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Linked Data Fragments (20)

Recently uploaded (20)

Linked Data Fragments