<!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 />
    <article-meta>
      <title-group>
        <article-title>Mapping, enriching and interlinking data from heterogeneous distributed sources</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anastasia Dimou supervised by Rik Van de Walle</string-name>
          <email>anastasia.dimou@ugent.be</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Erik Mannens</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ruben Verborgh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ghent University iMinds Multimedia Lab Gaston Crommenlaan 8 bus 201</institution>
          ,
          <addr-line>9050 Ghent</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>As Linked Open Data is gaining traction, publishers incorporate more their data to the cloud. Since the whole Web of Data cannot be semantically represented though, data consumers should also be able to map any content to rdf on-demand to answer complicated queries by integrating information from multiple heterogeneous sources distributed over the Web or not. In both cases, the quality and integrity of the generated rdf output a ects the performance of traversing and querying the Linked Open Data. Thus, well-considered and automated approaches to semantically represent and interlink, already during mapping, the domain level information of distributed heterogeneous sources is required. In this paper, we outline a plan to tackle this problem: We propose a uniform way of de ning how to map and interlink data from heterogeneous sources, alternative approaches to perform the mappings and methods to assess the quality and integrity of the resulting Linked Data sets.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>E ciently extracting and integrating information from diverse, distributed and
heterogeneous sources to enable rich knowledge generation that can more
accurately answer complicated queries and lead to e ective decision making,
remains one of the most signi cant challenges. Nowadays, Semantic Web enabled
technologies become more mature and the rdf data model is gaining traction
as a prominent solution for knowledge representation. However, only a limited
amount of data is available as Linked Data, because, despite the signi cant
number of existing tools, acquiring its rdf representation remains complicated.</p>
      <p>Deploying the ve stars of the Linked Open Data schema1 is still the de-facto
way of incorporating data to the Linked Open Data (lod) cloud. Approaching
though the stars as a set of consecutive steps and applying them to separately
individual sources, disregarding possible prior de nitions and links to other
entities, leads in failing to reach the uppermost goal of publishing interlinked data.
Manual alignment to their prior appearances is often performed by rede ning
their semantic representations, while links to other entities are de ned after the
1 http://5stardata.info/
data is mapped and published. Identifying, interlinking or replicating, and
keeping them aligned is complicated and the situation aggravates the more data is
mapped and published. Existing solutions tend to generate multiple Unique
Resource Identi ers (uris) for the same entities while duplicates can be found even
within a publisher's own datasets. Hence, demand emerges for a well-considered
policy regarding mapping and interlinking of data in the context of a certain
knowledge domain, either to incorporate the semantically enriched data to the
lod or to answer a query on-the- y.</p>
      <p>So far, there is neither uniform mapping formalisation to de ne how to map
and interlink heterogeneous distributed sources into rdf in an integrated and
interoperable fashion nor complete solution that supports the whole mapping
and interlinking procedure together. Apart from few domain speci c tools, none
of the existing solution o er the option to automatically detect the described
domain and propose corresponding mapping rules. Except for the eld of plain
text analysis where again the main focus is on semantically annotating the text
rather than describing a domain and the relationships between its entities.
Moreover, there are are no means to validate and check the consistency, quality and
integrity of the generated output, apart from manual user-driven controls, and no
means to automate these tests and incorporate them in the mapping procedure.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Relevancy</title>
      <p>The problem is directly relevant to data publishing and data consumption with
an emphasis on semantically-enabled data integration. In the data publishing end
of spectrum, domain level information can be integrated from a combination of
heterogeneous sources and published as Linked Data, using the rdf data model.
In the data consumption end of spectrum, the relevancy is two-fold: (i) On the
one hand, the quality and integrity of the resulting rdf representation is re ected
at the dataset' s consumption. (ii) On the other hand, data extracts can be
mapped and interlinked on-demand and on-the- y from di erent heterogeneous
sources, since not all data can be represented as Linked Data. On the whole,
the problem is relevant to the alignment and synchronisation of data's semantic
and non-semantic representations; modi cations (inserts, updates and deletions)
need to be synchronised over data's semantic and non-semantic representation.</p>
      <p>The problem is emphasized in cases of knowledge acquisition, searching or
query answering that information integration is required from a combination of
distributed and heterogeneous (semantic and/or non-semantic) data sources.
Especially when it is taken into consideration data that cannot be easily traversed
else, for instance the deep Web or large volumes of published data les.
Semantic Web technologies together with the rdf data model allows to deliberately
concatenate the extract of data that is relevant.</p>
      <p>There are several stakeholders that could take advantage of such information
integration enhanced with semantic annotation. Such key stakeholders are those
who publish and consume large volumes of data that might be distributed and
appear in heterogeneous formats. For instance, governments that publish and
consume, at the same time, Open Data, scientists that combine data from di
erent sources and re-publish processed information or (data) journalists that need
extracts of data from several sources to acquire knowledge and draw conclusions.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Related Work</title>
      <p>
        Several solutions exist to execute mappings from di erent le structures and
serialisations to rdf. Di erent mapping languages beyond r2rml were de ned [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] in
the case of relational databases and several implementations already exist2.
Similarly, mapping languages were de ned to support conversion from data in csv
and spreadsheets to the rdf data model. For instance, the XLWrap's mapping
language [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] that converts data in various spreadsheets to rdf, the declarative
owl-centric mapping language Mapping Master's M2 [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] that converts data
from spreadsheets into the Web Ontology Language (owl), Tarql3 that follows
a querying approach and Vertere4 that follows a triple-oriented approach as
r2rml does too. The main drawback in the case of most row-oriented mapping
solutions is the assumption that each row describes an entity (entity-per-row
assumption) and each column represents a property.
      </p>
      <p>
        A larger variety of solutions exist to map data from xml to rdf, but to
the best of our knowledge, no speci c languages were de ned for this, apart
from the w3c standardized grddl5 that essentially provides the links to the
algorithms (typically represented in xslt) that maps the data to rdf. Instead,
tools mostly rely on existing xml solutions, such as xslt (e.g., Krextor [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] and
AstroGrid-D6), xpath (e.g., Tripliser7), and xquery (e.g., XSPARQL [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]).
      </p>
      <p>
        In general, most of the existing tools deploy mappings from a certain source
format to rdf (per-source approaches ) and only few tools provide mappings
from di erent source formats to rdf. Datalift [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], The DataTank8, Karma9,
OpenRe ne10, RDFizers11 and Virtuoso Sponger12 are the most well-known. But
those tools actually either employ separate source-centric approaches for each of
the formats they support, for instance Datalift, or rely on converting data from
other formats to a master which in most cases is table-structured, for instance
Karma or Open Re ne. Furthermore, none of them provides an approach where
the mapping de nitions can be detached from the implementation.
      </p>
      <p>Beyond pure execution of mappings to rdf, most of the existing tools do
not provide any recommendations regarding how the data should be mapped,
2 http://www.w3.org/2001/sw/rdb2rdf/wiki/Implementations
3 https://github.com/cygri/tarql
4 https://github.com/knudmoeller/Vertere-RDF
5 http://www.w3.org/TR/grddl/
6 http://www.gac-grid.de/project-products/Software/XML2RDF.html
7 http://daverog.github.io/tripliser/
8 http://thedatatank.com
9 http://www.isi.edu/integration/karma/
10 http://openrefine.org/
11 http://simile.mit.edu/wiki/RDFizers
12 http://virtuoso.openlinksw.com/dataspace/doc/dav/wiki/Main/VirtSponger
namely how to model the domain described. Only Karma o ers mapping
recommendation, however it relies on a training algorithm that improves when several
domain-relevant data sources are mapped. Among the other tools, only Open
Re ne supports recommendations to a certain extend, but its recommendations
have the form of disambiguating named entities appearing in the lod.</p>
      <p>As described, existing tools are solely focused on mapping data to the rdf
model, rather than interlinking the entities of the source to existing entities
appearing on the Web. Only Open Re ne allows to reconcile and match entities to
resources published as Linked Data and Datalift which incorporates
interlinking functionality but only as a subsequent step executed after the mapping is
completed. Overall, till nowadays, mapping and interlinking are considered two
steps that are executed consecutively. A lot of work has been done in the eld of
text analysis, natural language processing (nlp) and named entity recognition
(ner) to identify and disambiguate entities with resources appearing in the lod
cloud. However such techniques are mainly focused on semantically annotating
the text rather than modelling the domain described. Moreover these techniques
are not applied in the case of (semi-)structured mappings.</p>
      <p>
        Last but not least, none of the existing tools o er a complete solution that
allows to re ne the executed mappings based on the users' feedback, the results of
data cleansing tools, reasoning over the ontologies used or studying the integrity
and connectedness of the resulting dataset considering it as a graph. A summary
of existing approaches for assessing data quality that could be incorporated
for re ning the mappings according to the result of a mapping can be found
at [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Among the pioneer tools for rdf data cleansing are the user-driven
TripleCheckMate [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and the test-driven RDFUnit [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Again only Karma is
capable of re ning its proposed mapping according to users' intervention.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Research Questions</title>
      <sec id="sec-4-1">
        <title>The main question in my doctoral research is:</title>
        <p>{ How can we access and represent domain level information from distributed
heterogeneous sources in an integrated and uniform way?</p>
      </sec>
      <sec id="sec-4-2">
        <title>On the one hand, the accessing aspect needs to be investigated:</title>
        <p>{ How can we enable querying distributed heterogeneous sources on the Web in a
uniform way?
On the other hand, the representation aspect needs to be investigated:
{ How can we identify if entities of a source have already been assigned a URI and
enrich this unique representation with new properties and links?
{ How can we interlink newly generated resources with existing ones already during
mapping considering the available domain information we have?</p>
      </sec>
      <sec id="sec-4-3">
        <title>And the overall result raises the following questions:</title>
        <p>{ How can we assure that if we map some sources the domain is accurately modelled?
{ How well the entities of the dataset are linked with each other?
{ How well the dataset is linked with the lod cloud?</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Hypotheses</title>
      <p>The main hypotheses related to my research are:
{ Integrated mapping and interlinking of data in heterogeneous sources
generates fewer overlapping entities and models better the domain's semantics.
{ Reusing Unique Resource Identi ers (uris) leads to more robust and uniform
datasets that have higher integrity and connectedness.
{ Interlinking such datasets raises the integrity and connectedness of the whole
lod and improves the performance of its consumption.
{ Not all media can be published as Linked Open Data, thus mapping extracts
of multiple heterogeneous data to rdf might occur on demand.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Approach</title>
      <p>At this PhD, we propose a generic mapping methodology, that maps the data
independently of the source structure (source-agnostic), puts the focus on
mappings and their optimal reuse and considers interlinking already during
mappings. Therefore, the initial learning costs remain limited, the potential for the
custom-de ned mapping's reuse augments and a richer and more meaningful
interlinking is achieved. This is a prominent advancement compared to the
approaches followed so far. As a result, the per-source mapping model followed
so far gets surpassed, leading to contingent data integration and interlinking.
Beyond the language that facilitates the mapping rules' de nition and is the
core of our solution, we propose a complete approach that aims to facilitate and
improve the mappings de nition and execution.</p>
      <p>In our proposed approach we aim to maximize the reuse of existing unique
identi ers (uris) and rely on the links between them and the newly generated
entities to achieve the interlinking of the new dataset with the lod. The
disambiguated entities are assigned the corresponding uris and their representation
is enriched with properties and relationships of the newly incorporated dataset.
In contrast to the approaches followed so far, custom-generated uris are only
assigned to the entities that were not identi ed in the lod cloud (not
disambiguated). Based on the relationships between the newly generated entities and
the disambiguated ones, the interlinking of the newly generated resources with
the lod is achieved. In order to identify such entities, we propose applying ner
techniques to the sources and use them against datasets of the lod.</p>
      <p>Besides increasing the integrity of the dataset and reinforcing its interlinking
with the lod cloud, the whole domain needs to be modelled. Recommendations
based on vocabularies used for the description and for the relationships of the
disambiguated entities or other entities that are identi ed to model the same
domain and those appearing in a vocabularies' repository, such as lov13, can be
taken into consideration. The domain can be further re ned after the execution of
the mappings and the assessment of the output dataset using tools for evaluating
13 http://lov.okfn.org
the data quality or taking into considerations the users' feedback. In these cases,
the mapping rules can be adjusted to incorporate the emerging rules.
7</p>
    </sec>
    <sec id="sec-7">
      <title>Preliminary results</title>
      <p>
        We already de ned a generic language adequate for de ning rules to map
heterogeneous sources into rdf in a uniform and integrated way [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This language
is the rdf Mapping Language (rml) 14, de ned as a superset of the w3c
standardized mapping language r2rml. rml broadens r2rml's scope and extends
its applicability to any data structure and format. rml came up as a result of
our need to map heterogeneous data to rdf. Initially, r2rml was extended to
map data from hierarchically structured sources e.g., xml or json, to rdf.
Details about how we extended the row-oriented r2rml to deal with hierarchy, and
other structures in general, are described in detail at our previous work [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Even though the language's extensibility is self-evident as rml relies on an
extension over r2rml, its scalability was also proven by further extending it to map
data published as html pages to the rdf data model. Results of the mappings
from html to rdf using rml were presented at the Semantic Web publishing
challenge of the 11th Extended Semantic Web Conference (ESWC14) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. At the
moment, in total, rml and the prototype processor support, but are not limited,
mappings from data in csv, xml, json and html to the rdf data model.
      </p>
      <p>
        A prototype processor15 was designed and implemented as a proof-of-concept
to accompany the rml mapping language. As rml extends r2rml, the
processor is implemented using an existing open-source r2rml processor16. The rml
processor was designed to have a modular architecture where the extraction and
mapping modules are independently executed and the extraction module can
be instantiated depending on the possible inputs. Short discussion regarding
alternative approaches for processors supporting rml were discussed at [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Finally, some preliminary work on mapping rules' re nements by
incorporating data consumers' feedback was presented at [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. We showed how provenance
generated during mapping can be used later on to identify the mapping rules
that should be adjusted to incorporate data consumers' feedback.
8
      </p>
    </sec>
    <sec id="sec-8">
      <title>Evaluation plan</title>
      <p>There are di erent aspects of the proposed solution which need to be assessed
and we are aiming to evaluate: the RML mapping language itself, the semantic
annotations and the entities interlinking, the quality and integrity of the resulting
dataset and the performance of the mapping execution.</p>
      <p>{ the language's potential in regard to (i) the range of input sources supported
and their possible combinations for providing integrated mappings, namely
14 http://rml.io
15 https://github.com/mmlab/RMLProcessor
16 https://github.com/antidot/db2triples
the language's scalability and extensibility ; (ii) the language's expressivity,
namely the coverage of possible alternative mapping rules, mainly in
comparison to other languages (or approaches) and (iii) last, how reusable and
interoperable the mapping descriptions are.
{ the validity, consistency and relevance (especially when the domain is
modelled according to automated recommendations) of the vocabularies used by
the mapping rules to describe the domain knowledge.
{ the quality of the output. To achieve this, both automated solutions
assessing data quality and domain experts will be used to evaluate the resulting
dataset in regard to the identi ed or generated entities, the provided
semantic annotations, the interlinking and the overall modelling of the domain.
{ the accuracy and the precision and recall of the retrieved, identi ed and
enriched entities in conjunction with the con dence for the interlinked entities.
{ the integrity of the resulting dataset and the overall analysis of the output's
datasets in respect to its graph-based representation, for instance in and out
degree, its connectivity, its density, bridges, paths etc.
{ the impact of the resulting dataset's structure and interlinking in respect to
its subsequent consumption. To be more precise, how traversing and querying
the dataset is a ected by the choices taken while modelling the knowledge
domain. In the case of querying, we aim to examine both the complexity of
the queries de nition and the time and overload to execute them.
{ nally, while the performance is important to verify that the mappings can
be executed in reasonable time, the performance of an rml processor is not
the main focus of this work. However, the two fundamental ways of executing
the mappings (mapping-driven or data-driven) will be evaluated and
compared to identify best use-cases. The execution planning of the mapping rules
though is more interesting and will be deeper investigated and evaluated.
9</p>
    </sec>
    <sec id="sec-9">
      <title>Re ections</title>
      <p>The main di erence of our approach compared to existing works on mapping
data is that we (i) introduce the idea of a uniform way of dealing with the
mapping of heterogeneous sources and (ii) introduce the aspect of interlinking
while we perform the mapping of data to the rdf data model. We approach the
mapping from a domain modelling perspective where the data is either
incorporated to a partially described domain or is mapped combined, forming their
own domain. This way, we achieve generating datasets with higher integrity that
are already interlinked among each other and with the lod and thus we reduce
the e ort for subsequent interlinking of resources and o er better conditions for
their subsequent consumption.</p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgement</title>
      <p>The research described in this paper is funded by Ghent University, the Flemish
Department of Economy, Science and Innovation (EWI), the Institute for the
Promotion of Innovation by Science and Technology in Flanders (IWT), the Fund
for Scienti c Research-Flanders (FWO-Flanders), and the European Union.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>S.</given-names>
            <surname>Bischof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Decker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Krennwallner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lopes</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Polleres</surname>
          </string-name>
          .
          <article-title>Mapping between RDF and XML with XSPARQL</article-title>
          .
          <source>Journal on Data Semantics</source>
          ,
          <volume>1</volume>
          (
          <issue>3</issue>
          ):
          <volume>147</volume>
          {
          <fpage>185</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Colpaert</surname>
          </string-name>
          , L. De Vocht,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          , E. Mannens, and R. Van de Walle.
          <article-title>Extraction and semantic annotation of workshop proceedings in HTML using RML</article-title>
          .
          <source>In Semantic Publishing Challenge of the 11th Extended Semantic Web Conference</source>
          , May
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          , E. Mannens, and R. Van de Walle.
          <article-title>RML: A generic language for integrated RDF mappings of heterogeneous data</article-title>
          .
          <source>In Proceedings of the 7th Workshop on Linked Data on the Web, Apr</source>
          .
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          , T. De Nies,
          <string-name>
            <given-names>R.</given-names>
            <surname>Verborgh</surname>
          </string-name>
          , E. Mannens, and R. Van de Walle.
          <article-title>RDF mapping rules re nements according to data consumers feedback</article-title>
          .
          <source>In 2nd International World Wide Web Conference, Poster Track Proceedings</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Dimou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Vander</given-names>
            <surname>Sande</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Slepicka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Szekely</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Mannens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Knoblock</surname>
          </string-name>
          , and R. Van de Walle.
          <article-title>Mapping hierarchical sources into RDF using the RML mapping language</article-title>
          .
          <source>In Proceedings of the 8th IEEE International Conference on Semantic Computing</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Hert</surname>
          </string-name>
          , G. Reif, and
          <string-name>
            <given-names>H. C.</given-names>
            <surname>Gall</surname>
          </string-name>
          .
          <article-title>A comparison of RDB-to-RDF mapping languages</article-title>
          .
          <source>In Proceedings of the 7th International Conference on Semantic Systems, I-Semantics '11</source>
          , pages
          <fpage>25</fpage>
          {
          <fpage>32</fpage>
          . ACM,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>D.</given-names>
            <surname>Kontokostas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Westphal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Hellmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Cornelissen</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaveri</surname>
          </string-name>
          .
          <article-title>Test-driven evaluation of linked data quality</article-title>
          .
          <source>In Proceedings of the 23rd International Conference on World Wide Web, WWW '14</source>
          , pages
          <fpage>747</fpage>
          {
          <fpage>758</fpage>
          . International World Wide Web Conferences Steering Committee,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>D.</given-names>
            <surname>Kontokostas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaveri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          .
          <article-title>Triplecheckmate: A tool for crowdsourcing the quality assessment of linked data</article-title>
          .
          <source>In Knowledge Engineering and the Semantic Web</source>
          , volume
          <volume>394</volume>
          of Communications in Computer and Information Science, pages
          <volume>265</volume>
          {
          <fpage>272</fpage>
          . Springer Berlin Heidelberg,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>C.</given-names>
            <surname>Lange</surname>
          </string-name>
          .
          <article-title>Krextor - an extensible framework for contributing content math to the Web of Data</article-title>
          .
          <source>In Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics, MKM'11</source>
          . Springer-Verlag,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>A.</given-names>
            <surname>Langegger</surname>
          </string-name>
          and W. Wo .
          <article-title>XLWrap { Querying and Integrating Arbitrary Spreadsheets with SPARQL</article-title>
          .
          <source>In Proceedings of the 8th International Semantic Web Conference, ISWC '09</source>
          , pages
          <fpage>359</fpage>
          {
          <fpage>374</fpage>
          . Springer-Verlag,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>M. J. O'Connor</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Halaschek-Wiener</surname>
            , and
            <given-names>M. A.</given-names>
          </string-name>
          <string-name>
            <surname>Musen</surname>
          </string-name>
          .
          <article-title>Mapping Master: a exible approach for mapping spreadsheets to OWL</article-title>
          .
          <source>In Proceedings of the 9th International Semantic Web Conference on The Semantic</source>
          Web - Volume
          <string-name>
            <surname>Part</surname>
            <given-names>II</given-names>
          </string-name>
          , ISWC'
          <volume>10</volume>
          , pages
          <fpage>194</fpage>
          {
          <fpage>208</fpage>
          . Springer-Verlag,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. F. Schar e, G. Atemezing,
          <string-name>
            <given-names>R.</given-names>
            <surname>Troncy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Gandon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Villata</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Bucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Hamdi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bihanic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Kepeklian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Cotton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Euzenat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Fan</surname>
          </string-name>
          , P.-Y. Vandenbussche, and
          <string-name>
            <given-names>B.</given-names>
            <surname>Vatant</surname>
          </string-name>
          .
          <article-title>Enabling Linked Data publication with the Datalift platform</article-title>
          .
          <source>In Proc. AAAI workshop on semantic cities</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>A.</given-names>
            <surname>Zaveri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Rula</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Maurino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pietrobon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Auer</surname>
          </string-name>
          .
          <article-title>Quality assessment for linked open data: A survey. Submitted to the Semantic Web Journal</article-title>
          .,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>