<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>April</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Exploring RDF Usage and Interlinking in the Linked Open Data Cloud using ExpLOD</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Shahan Khatchadourian</string-name>
          <email>shahan@cs.toronto.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mariano P. Consens</string-name>
          <email>consens@cs.toronto.edu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Toronto</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2010</year>
      </pub-date>
      <volume>27</volume>
      <issue>2010</issue>
      <abstract>
        <p />
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>OVERVIEW</title>
      <p>
        A key challenge of describing Linked Data [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] datasets is
to understand the data, schema, and interlinks that are
actually used both within and across linked datasets.
Understanding how resources are used (or RDF usages, as in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]) is
critical in the increasingly common situations where terms
from di erent vocabularies are mixed. This is because
developers need to know the concepts mentioned in the dataset in
order to contribute interlinks between datasets, or for novel
mashups (enabled by the abundance of linked data, see [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ])
involving resources described across several datasets.
      </p>
      <p>
        Existing solutions to the challenge currently involves
using an RDF browsers (such as [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]) to explore linked
data which can be a tedious and time-consuming exercise
for large datasets. A trial-and-error approach on a
schemaconformant dataset means testing for structures permitted
by the schema and becomes complex if the dataset does not
use the full schema or uses multiple schemas due to the
combinatorial ways of mixing terms. In the LOD cloud this is
exacerbated since there is no schema describing interlinking
between datasets, so another approach is needed.
      </p>
      <p>
        In this demonstration we present a tool, ExpLOD, that
supports exploring summaries of RDF usage and
interlinking among datasets from the Linked Open Data cloud. An
RDF summary can be used to describe a dataset by
grouping equivalent RDF resources. ExpLOD's summaries are
based on a novel mechanism that combines text labels and
bisimulation contractions (see [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] for details).
      </p>
      <p>The summaries produced by ExpLOD can be created,
viewed, and explored in an interactive graphical
environment (and they can also be exported in a variety of
formats, including RDF). ExpLOD is a Java application
developed within the Eclipse environment with support for
plug-ins. Custom code was developed using the Jena toolkit
(jena.sourceforge.net). ExpLOD can also invoke the Virtuoso
RDF store (www.openlinksw.com/virtuoso).
2.</p>
    </sec>
    <sec id="sec-2">
      <title>EXPLOD DEMONSTRATION</title>
      <p>
        Summaries of RDF data are computed using bisimulation
labels (BL) based on RDF usage. RDF usage, discussed and
enumerated in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], is a way describe the semantics of RDF
resources based on how they are used, such as whether a
resource is used as part of the data or schema. The
demonstration describes the exibility of modifying the labeling
scheme to obtain a coarser or more detailed summary for
datasets in the LOD cloud (Section 2.1). We also
demonstrate how a larger RDF usage neighbourhood can be
employed to describe interlinked datasets (Section 2.2).
2.1
      </p>
    </sec>
    <sec id="sec-3">
      <title>Class and Predicate Usage</title>
      <p>Four RDF usages that describe the interaction of data
and meta-data are: (i) class instantiation, the number of
instances that are typed as a particular class; (ii) predicate
instantiation, the number of times a predicate is used to
describe all instances; (iii) class usage, the sets of classes to
which instance belongs; and (iv) predicate usage, the sets of
predicates used to describe an instance. A class and
predicate RDF usage summary is used to describe DBTune's
Jamendo, a dataset from the LOD cloud containing
information about music artists and their productions. Our goal
is to understand how tracks and records are described</p>
      <p>Figure 1 shows the RDF usage summary of class and
predicate instantiation, and class and predicate usage, for records
and tracks in Jamendo. Class instantiation for each class is
reported in its block extent size (between parentheses). So
5,786 instances are typed as records, as can be seen in class
block 5 whose BL begins with 'C/'. Even though class
instantiation cannot distinguish instances that belong to more
than one class, it is possible to do so with class usage. The
class usage of instance block 1430 is the singleton mo:Track
since there is only class block reachable from the instance
block. Predicate instantiation is captured in the extent size
of predicate blocks (whose BL has pre x 'P/'). For
example, the predicate mo:license has been used to describe
instances 45,634 times. The predicate usage of instance block
1430 (containing tracks) is the set of predicates fmo:license,
mo:track number, mo:available as, dc:title, rdf:typeg, visible
by the edges from the instance block to each of those
predicate blocks. Notice that grouping instances having the same
class usage and predicate usage into the same instance block
(the extent size reports the number of instances) results in 7
record instance blocks, each of which has a unique predicate
usage. Amongst records, there is variation in the extent size
of predicate usages - the extent size of instance block 1361
is 4,509 compared to the extent size of instance block 1388
that contains only 1 record instance.</p>
      <p>To reduce the number of blocks in an RDF usage
summary, using a reduced portion of the BL hierarchy can
sometimes produce a summary with fewer blocks, and as many
blocks as before (in the worst case). For example, excluding
the local part of each predicate's BL groups predicates by
their namespace. Applying this modi cation to the BL to
the summary in Figure 1 produces the summary shown in
Figure 2. The change in BL reduced the number of instance
blocks from 8 to 3.
2.2</p>
    </sec>
    <sec id="sec-4">
      <title>Interlinking</title>
      <p>Two interlinked RDF datasets in the LOD cloud may
contain information about the same real-world entity, but it is
possible that each dataset uses its own unique URI to
represent it. A triple with an owl:sameAs predicate captures the
information that the subject and object URIs refer to the
same real-world entity, referred to as URI-equivalence; such
statements can be found readily within many datasets in
the LOD cloud. A resource's description in one dataset may
not match the description of its URI-equivalent resource in
another dataset.</p>
      <p>An interlink usage summary is created from the
bisimulation contractions of URI-equivalent resources is used to
understand each dataset's contribution to a real-world
entity's description. An interlink usage neighbourhood is the
subgraph that includes the nodes and edges on the path
linking the subject of a triple whose predicate is owl:sameAs to
the object node. Additionally, the incoming edge of each
owl:sameAs predicate node is reversed, both in the labeled
graph and the ExpLOD graph, so that it points to the
subject. Since we are interested in the description of instances,
we consider only statements in which the subject and
object are instances. Creating a summary based on interlink
usage neighbourhoods as well as class and predicate usage
neighbourhoods provides additional information about
URIequivalent resource descriptions.</p>
      <p>An interlink usage summary of URI-equivalent instances
from two datasets in the RKB Explorer collection is shown
in Figure 3. It displays a block containing 57 instances that
have the same class and predicate usage in Southampton,
and the block of URI-equivalent instances in Newcastle that
have the same class usage. This asymmetry is chosen as
a way to demonstrate the exibility of the neighbourhoods
that are summarized.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>S.</given-names>
            <surname>Bernhard</surname>
          </string-name>
          . Tripcel:
          <article-title>Exploring RDF Graphs using the Spreadsheet Metaphor</article-title>
          .
          <source>In ISWC</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>C.</given-names>
            <surname>Bizer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Heath</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Idehen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          .
          <article-title>Linked data on the web</article-title>
          .
          <source>In LDOW</source>
          , pages
          <volume>1265</volume>
          {
          <fpage>1266</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>F. C. de Araujo</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Schwabe</surname>
          </string-name>
          .
          <article-title>Explorator: a tool for exploring RDF data through direct manipulation</article-title>
          .
          <source>LDOW</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>L.</given-names>
            <surname>Ding</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Finin</surname>
          </string-name>
          .
          <article-title>Characterizing the Semantic Web on the Web</article-title>
          .
          <source>In ISWC</source>
          , pages
          <volume>242</volume>
          {
          <fpage>257</fpage>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hausenblas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Halb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Raimond</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Heath</surname>
          </string-name>
          .
          <article-title>What is the Size of the Semantic Web? In I-SEMANTICS</article-title>
          , pages
          <volume>9</volume>
          {
          <fpage>16</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Khatchadourian</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. P.</given-names>
            <surname>Consens</surname>
          </string-name>
          .
          <article-title>Exploring RDF Usage and Interlinking in the Linked Open Data Cloud using ExpLOD</article-title>
          . To appear
          <source>in ESWC</source>
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>