Linked Data (LD) are structured sources of information, such as DBpedia or Geonames, that can be linked together and queried . The information they contain is atomized into triples, each triple being a simple statement composed of a subject, a predicate and an object. Triples can then be combined to form higher level statements following information needs. This granularity makes it difficult to produce overviews of LD content . We therefore introduce the concept of path-based summaries  which carries a higher level of semantics for data producers. We also introduce the tool Path Outlines to support LD producers in browsing path-based summaries of their datasets. We present its interface based on the broken (out)lines layout algorithm and the path browser visualisation. Our approach, reifying chains of statements into path outlines, was informed by the observation of LD producers and we report a characterisation of their needs. We compare Path Outlines with the current baseline technique (Virtuoso SPARQL query editor) in an experiment with 36 participants. We show that participants prefer Path Outlines , find it easier to understand, easier to use, faster, and lowering the number of tasks that users give-up before completing them .
The Semantic Web is made of structured sources of information, such as DBpedia or GeoNames, also known as Linked Data (LD). They can be linked and queried together . The information they contain is atomized into triples, each triple being a simple statement composed of a subject, a predicate and an object. Triples can be combined to form higher level statements following information needs. But reconstituting chains of triples has a cognitive cost, and this makes it difficult for data producers to have meaningful overviews of the content of their own datasets. We report a characterisation of LD producers' needs, and introduce the concept of path-based summaries , which carries a higher level of semantics , to meet their needs. We present the tool Path Outlines to support LD producers in browsing path-based summaries of their datasets. We describe its interface based on the broken (out)lines layout algorithm and the path browser visualisation. We compare Path Outlines with the current baseline technique (Virtuoso SPARQL query editor) in an experiment with 36 participants. We show that Path Outlines is faster, leads to better task completion and less errors, and that participants prefer it, find it easier and more comfortable to use .
R
Linked Data (LD) are
The Semantic Web is made of
R
Geonames, that
GeoNames, also known as Linked Data (LD). They
R
together and queried
and queried together
D
then
R
This granularity
But reconstituting chains of triples has a cognitive cost, and this
R
to produce overviews of LD content . We therefore
for data producers to have meaningful overviews of the content of their own datasets. We report a characterisation of LD producers' needs, and
A
,
R
for data producers. We also introduce
, to meet their needs. We present
R
present
describe
D
Our approach, reifying chains of statements into path outlines, was informed by the observation of LD producers and we report a characterisation of their needs.
R
participants prefer Path Outlines ,
Path Outlines is faster, leads to better task completion and less errors, and that participants prefer it,
R
to understand, easier to use, faster, and lowering the number of tasks that users give-up before completing them
and more comfortable to use