<!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>Towards a Knowledge Graph Lifecycle: A pipeline for the population of a commercial Knowledge Graph</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Umutcan Simsek</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jurgen Umbrich</string-name>
          <email>juergen.umbrich@onlim.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dieter Fensel</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Onlim GmbH Telfs</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Semantic Technology Institute Innsbruck, University of Innsbruck Technikerstrasse 21a</institution>
          ,
          <addr-line>6020 Innsbruck</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper is a use case report for the population architecture of a commercial Knowledge Graph. We introduce our pilots and their focus within the MindLab Project, which aims to build Knowledge Graphs with a lifecycle-based approach to enable conversational agents. We describe and evaluate our pipeline for the rst step of the lifecycle, namely Knowledge Creation. Our approach satis es all de ned requirements in terms of provenance tracking, scalability, and usability.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge Graph</kwd>
        <kwd>Data pipeline</kwd>
        <kwd>Knowledge Creation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Knowledge Graphs are an important means to provide large-scale integrated
data to intelligent applications like conversational agents. Making a Knowledge
Graph a useful resource requires to complete a set of tasks that comprise the
Knowledge Graph lifecycle [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]:
      </p>
      <p>For each of these tasks, there are various approaches, mainly developed and
applied in an ad hoc way. Even for the - seemingly straightforward -
Knowledge Creation task, there are bureaucratic and technical challenges due to the
variety and heterogeneity of data sources. In this paper, we address this very
task by providing a holistic approach and architecture to populate a commercial
Knowledge Graph based on heterogeneous data sources. The Knowledge Graph
is built in the scope of the MindLab project3, which aims to build industrial
Knowledge Graphs to enable conversational agents in domains like e-tourism
and beyond. In the remainder of the paper, rst, we describe the use cases and
their requirements that our Knowledge Graph must ful ll (Section 2). We
describe our technical approach that provides a work ow for creating knowledge
from heterogeneous sources and populating a Knowledge Graph (Section 3). We
give a brief overview of the related work in Section 5. Last but not least, we
evaluate our technical approach in terms of satisfying the requirements (Section
4) and conclude with nal remarks and future directions in Section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Use Case Description</title>
      <p>
        Our general use case is to import and integrate various heterogeneous data
sources into one coherent data model using a schema that is highly aligned
to the schema.org, a de facto standard for annotations on the web [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. The data
sources itself can be of various sizes and contain dynamic or rather static data.
Our use cases must track the provenance of the sources, such as the importing
time, origin, and mapping speci cation.
2.1
      </p>
      <sec id="sec-2-1">
        <title>Pilots and Data Sources</title>
        <p>In total, we selected three pilots from the tourism domain in our project. The
three pilots are 1) Seefeld, 2) Serfaus-Fiss-Ladis, and 3) Mayrhofen.</p>
        <p>All pilots have in common that users will interact with a bot in natural
language (either via text or voice) and inquire about information related to the
tourism domain. The data itself is modeled and stored in the form of a Knowledge
Graph, which should be exploited to get i) a better language understanding,
ii) more precise answers (result presentation), and iii) data-driven and guided
dialogs.</p>
        <p>Additionally, all pilots will operate over a set of data sources that contain
information about various accommodation providers and local businesses, events,
sports activities (e.g., hiking, trails, skiing), and sports areas (e.g., ski resorts)
or webcams. The core tourism data is provided by ve di erent data providers.
Feratel provides accommodation and event data, General Solutions geospatial
data, Intermaps ski resorts and slopes, Outdooractive outdoor activity data (e.g.,
hiking tours), and Verkehrsauskunft O sterreich transportation data. The data
comes in various formats (e.g., JSON and XML) and is either supplied in the
form of data dumps or via RESTful API requests.</p>
        <sec id="sec-2-1-1">
          <title>3 https://mindlab.ai</title>
          <p>Some pilots will further connect the tourism data to public and open data
sources, which contain additional common knowledge about some entities of
the tourism data. For instance, DBpedia4 and Wikidata5 provide additional
information about cities used in the pilots or descriptions about certain sports
activities. Also, publicly available geodata will be used for more advanced
geolocation related conversations (e.g., OpenStreetMap6). A prominent open-source
geodata provider is OpenStreetMap7.</p>
          <p>The data sources can provide static information (e.g., geolocations, names,
categories) but also dynamic information (e.g.,, the current weather, snow level,
open ski lifts, hotel rates, or transport information). Our solution needs to handle
and represent such dynamic information, either in the form of updates in the
Knowledge Graph or by specifying services to derive the current and most
upto-date information.
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Requirements</title>
        <p>Data importers The requirements for the data importers are that they have to
scale with the input data, be usable and easy expandable, and that they track
the provenance for generating statistics and easier debugging of the importer
pipeline.</p>
        <p>R-DI-prov the importers should track vital provenance and performance
metrics that are used to lter subgraphs, generate KPIs,
performance analysis, and assist debugging8.</p>
        <p>R-DI-scale data importers have to scale w.r.t. the number and size of input
sources. As such, the developed solutions should be executable
in parallel setup.</p>
        <p>R-DI-usability data importers should be designed in a way that they are easy
to extend and adapt to new data sources. Ideally, the importing
pipeline can be con gured and used without speci c technical
knowledge (e.g., programming language agnostic)
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Technical Approach</title>
      <p>In this section, we describe our technical approach to tackling the knowledge
creation task while addressing the requirements described in Section 2.2. The
major features of the architecture are:
{ Storing data as named graphs by utilizing quads</p>
      <sec id="sec-3-1">
        <title>4 https://wiki.dbpedia.org/</title>
        <p>5 https://www.wikidata.org/wiki/Wikidata:Main Page
6 https://www.openstreetmap.org/
7 https://www.openstreetmap.org/
8 Also aligned with the Data on the
https://www.w3.org/TR/dwbp/
Web</p>
        <p>Best</p>
        <p>Practices
{ Attaching provenance information based on the modeled provenance
metadata (Section 3.1)
{ Scalable mapper for RDF generation from heterogeneous sources
{ Flexible, declaratively con gurable work ow for managing new data sources
to populate the Knowledge Graph</p>
        <p>The following explains how these features are conceptualized and
implemented. We rst explain our provenance tracking approach, including our
metadata. Afterward, we describe our implementation, MindLab Importer, for the
overall knowledge graph construction process.
3.1</p>
        <sec id="sec-3-1-1">
          <title>Provenance Tracking</title>
          <p>
            The MindLab Knowledge Graph must be consumable by applications from
different perspectives such as data from certain providers or a given set of
geospatial areas (R-DI-prov). The MindLab Knowledge Graph will be constructed by
integrating data from heterogeneous sources. In order to satisfy the R-DI-prov
requirement, we use the named graph [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ] approach9. For each quad in the
Knowledge Graph, the fourth element is the context URI. The provenance information
is attached to this context URI. Based on the requirements mentioned above,
we identify named graphs per organization per IT solution provider. An
example URL for DMO Mayrhofen organization and feratel IT solution provider is
https://graph.mindlab.ai/tvb-mayrhofen/feratel.
          </p>
          <p>
            Provenance Metadata The metadata used for describing the provenance is
mainly based on two vocabularies, namely PROV-O [
            <xref ref-type="bibr" rid="ref11">11</xref>
            ] and schema.org [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ].
PROV-O is an ontology that provides types and properties to create metadata
about the provenance of anything, including information about entities, their
creation or modi cation process, and parties involved. Schema.org also provides
types and properties for describing datasets, which we adopt for the named
graphs in the MindLab Knowledge Graph. The provenance metadata relates to
PROV-O and schema.org, as described in Table 1.
          </p>
          <p>Listing 1.1 is an excerpt of the provenance information for a named graph.
The named graph is connected to the organization (i.e., DMO Seefeld) and the IT
solution provider (i.e., feratel) through schema:provider and prov:wasAttributedTo
properties.
3.2</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>MindLab Importer</title>
          <p>
            In this section, we introduce the architecture of the MindLab Importer and its
core components. Figure 1 provides an overview of the architecture. The central
component of the MindLab Importer is the Import Manager that coordinates
9 A comparison of di erent rei cation approaches can be found in [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ]. We adopt the
named graph approach since it has the least space complexity and is natively
supported by triple store implementations (e.g., GraphDB) and SPARQL
          </p>
          <p>
            Listing 1.1: An example provenance information attached TVB Seefeld and
feratel named graph
the import process. The data sources from which the Knowledge Graph is
populated are registered via a web interface to the Import Manager. When an import
starts, the Import Manager uses the source-speci c information (e.g., con
guration required to access an external source) to retrieve the raw data and passes
it to the mapping service. The service o ers a scalable RML [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ] mapper
implementation 10 [
            <xref ref-type="bibr" rid="ref13">13</xref>
            ] to the Import Manager11. The RDF data generated based
on schema.org is then returned to the Import Manager. The mapper service
caches mapping les when needed, in order to improve the overall performance.
The Import Manager pushes mapped data to its designated named graph in
the Knowledge Graph. After the import is complete for a source, the Import
Manager attaches the provenance information.
10 https://github.com/semantifyit/RocketRML
11 Depending on the IT solution provider, the mapping service may be replaced with
other means of generating RDF
          </p>
          <p>register
external</p>
          <p>data
sources</p>
          <p>MindLab
Import</p>
          <p>Manager
Collect Raw Data</p>
          <p>Map to schema.org
with RML</p>
          <p>Add provenance
information</p>
          <p>Store in GraphDB</p>
          <p>The import manager is implemented with the Apache NiFi12 data ow
management tool. NiFi o ers a UI for de ning data ows in a drag-and-drop manner,
alongside an API to create and manage such ows programmatically. It has many
features like load balancing, bu ering, guaranteed delivery and scheduling out of
the box. It o ers built-in processors for many tasks (e.g., connectors for di erent
database solutions) and generic HTTP processors for accessing external services
(e.g., our mapper service).</p>
          <p>A NiFi work ow consists of connected units called processor. A processor
typically receives a ow le, uses or manipulates it in some way and passes
a new ow le to another processor. A subset of connected processors can be
placed in containers called process groups. The Import Manager contains one
process group for each distinct IT Solution provider and a single NiFi processor
per organization per IT solution provider that acts as an initiator. This provides
exibility and scalability for the creation of new import tasks to some extent.
Once a ow for an IT solution provider is created, a new organization using
existing IT solution providers can create their own import task by just entering
the necessary con guration (e.g., organizations API key) through the registry.
The registry interface takes care of the generation of the initiator processor, and
its connection to the right work ow.
4</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>The data importing pipeline is implemented with Apache NiFi and a set of RML
Mappers. We ran an evaluation for 29 days between 23.06.2019 and 20.07.2019.</p>
      <p>
        We imported total nine named graphs: [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] mayrhofen, feratel; [21] seefeld,
feratel; [31] serfaus- ss-ladis, feratel; [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] mayrhofen, intermaps; [22] seefeld,
intermaps; [32] serfaus- ss-ladis, intermaps; [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] mayrhofen, outdooractive; [23]
seefeld, outdooractive; [33] serfaus- ss-ladis, outdooractive.
      </p>
      <p>We calculated the average, median and standard deviation of both size and
time elapsed for each import13. The entire graph ( 1.37M statements) is
imported in approximately 26 minutes. This number is well within the daily
frequency requirement. The largest graphs are provided from feratel, and they take
12 https://ni .apache.org/
13 see the full statistics at : https://docs.google.com/spreadsheets/d/1C4aoBsN9p16LjPOLy33M9d8Mz0tFeUErrJDvRn
approximately 1ms per Triple (Table 2). The overall overhead of API access and
authorization has a bigger impact than the actual generation of the data;
therefore, the time needed for generating RDF triples is actually signi cantly below
1ms per triple14. Moreover, Apache NiFi allows parallelization and distribution,
which we can adopt if necessary. We satisfy the requirement R-DI-scale.</p>
      <p>
        The Apache NiFi instance provides a user
interface for advanced settings and monitoring. Addi- Graph Time/Tripple
tionally, we provide a web interface for the creation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] 1.28
of new imports. For mappings, we utilize a declar- [21] 1.15
ative mapping language. The whole pipeline can [31] 1.05
be managed without any programming knowledge. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] 6.40
Therefore, R-DI-usability is satis ed. We attach [22] 21.73
provenance information to each imported state- [32] 4.11
ment. Additionally, Apache NiFi shows the prove- [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] 5.81
nance information at each processor and we provide [23] 7.30
a monitoring mechanism over the MindLab registra- [33] 10.99
tion interface. This way, we satisfy the R-DI-prov.
Knowledge Graphs are being adopted for
commercial usage internally to improve certain processes in
a company and as a service to enable external applications (see [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] for some
examples from big tech companies). We can classify the population process in four
categories namely: (1) manual population in a closed system, (2) manual
population by users/community, (3) automated population from (semi-)structured
data sources, (4) automated population from unstructured data sources [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] 15.
      </p>
      <p>
        Depending on the domain, one or a combination of some of the four approaches
is used more dominantly. For example, in the health domain, it is common to
extract knowledge from unstructured health records, whereas in the cultural
heritage domain, several methods need to be combined due to the
heterogeneity of the sources [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Many other examples of building Knowledge Graphs in
enterprises can be found in works like [
        <xref ref-type="bibr" rid="ref10 ref14 ref8">10, 14, 8</xref>
        ].
      </p>
      <p>
        A particularly related work to our Knowledge Graph construction pipeline
comes from the automation industry [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Festo builds a Knowledge Graph to
manage the technical con guration of their products in an e cient way. They
utilize R2RML for transforming data from their RDBMS to RDF and apply
OWL reasoning together with SWRL rules on the created data. Additionally,
they control the data ow with an Apache AirFlow based implementation. In our
scenario, we map heterogeneous hierarchical sources to schema.org; therefore, we
14 0.04ms per triple with 500K triples. see the performance statistics of RocketRML
      </p>
      <p>
        in https://sumutcan.github.io/kgb-workshop-presentation/#/8/1
15 We refer readers to Section 4 of Deliverable 2.1 of the MindLab project [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] for
an overview of the population process of various open and proprietary Knowledge
      </p>
      <p>Graphs
use RML instead of R2RML. Moreover, we have an additional provenance model,
since it is important to compartmentalize the data for di erent customers and
applications.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>In this paper, we described our use case, namely the population of MindLab
Knowledge Graph, that is generated based on heterogeneous semi-structured
data (e.g., in JSON and XML). Our main focus is the knowledge generation
pipeline that populates the MindLab Knowledge Graph. Currently, a big
majority of our data comes from external APIs that provide data in JSON and
XML format. We implemented a exible and scalable architecture based on a
high-performance RML mapper implementation and an open-source data ow
management tool, Apache NiFi. We demonstrated that the developed tool
satis es the requirements of the MindLab project regarding provenance tracking,
scalability, and usability.</p>
      <p>The next steps will focus on assessing and improving the quality and on
further enriching the knowledge of the MindLab Knowledge Graph. The quality
improvement step typically contains cleaning tasks such as handling the
detection and correction of errors, which may also be introduced by fusing duplicate
instances (e.g., di erent set of opening hours for the same hotel). We want to
enrich the knowledge graph by creating new relations between entities. This
involves to add new relations between entities (e.g.,, equality statements,
missing links, or pre-computed relations such as "inWalkingDistance"), but also new
information not available in the data sources. The Knowledge Graph should
contain not only facts but also the description of actions and services. For instance,
given the hotel domain, we do not only want to represent and search for hotel
information but also describe the actions related to hotels, such as booking a
hotel room or some services o ered by the hotel.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgment</title>
      <p>We would like to thank all participants of the MindLab project.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Carroll</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bizer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stickler</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Named graphs, provenance and trust</article-title>
          .
          <source>In: Proceedings of the 14th International Conference on World Wide Web</source>
          . pp.
          <volume>613</volume>
          {
          <fpage>622</fpage>
          . WWW '05,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          , New York, NY, USA (
          <year>2005</year>
          ). https://doi.org/10.1145/1060745.1060835
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. mindLab Consortium:
          <article-title>D2.1 data import and management</article-title>
          .
          <source>Tech. rep., mindLab Project</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Dimou</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vander</surname>
            <given-names>Sande</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Colpaert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Verborgh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Mannens</surname>
          </string-name>
          , E., Van de Walle, R.:
          <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>
          ), http://events.linkeddata.org/ldow2014/papers/ldow2014 paper 01.pdf
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Fensel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simsek</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Angele</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huaman</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , Karle, E.,
          <string-name>
            <surname>Panasiuk</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Toma</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Umbrich</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wahler</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Knowledge Graphs - Methodology</surname>
          </string-name>
          , Tools and Selected Use Cases. Springer (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Farber,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Bartscherer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Menne</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Rettinger</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Linked data quality of dbpedia, freebase, opencyc, wikidata, and yago</article-title>
          .
          <source>Semantic Web</source>
          <volume>9</volume>
          (
          <issue>1</issue>
          ),
          <volume>77</volume>
          {
          <fpage>129</fpage>
          (
          <year>2018</year>
          ), http://dblp.uni-trier.de/db/journals/semweb/semweb9.html#FarberBMR18
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Guha</surname>
            ,
            <given-names>R.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brickley</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Macbeth</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : Schema.
          <article-title>org: evolution of structured data on the web</article-title>
          .
          <source>Communications of the ACM</source>
          <volume>59</volume>
          (
          <issue>2</issue>
          ),
          <volume>44</volume>
          {
          <fpage>51</fpage>
          (
          <year>2016</year>
          ). https://doi.org/10.1145/2844544
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hernandez</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hogan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , Krotzsch, M.:
          <string-name>
            <surname>Reifying</surname>
            <given-names>RDF</given-names>
          </string-name>
          :
          <article-title>what works well with wikidata</article-title>
          ? In: Liebig,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Fokoue</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . (eds.)
          <source>Proceedings of the 11th International Workshop on Scalable Semantic Web Knowledge Base Systems. CEUR Workshop Proceedings</source>
          , vol.
          <volume>1457</volume>
          , pp.
          <volume>32</volume>
          {
          <fpage>47</fpage>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Hubauer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lamparter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Herzig</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          :
          <article-title>Use cases of the industrial knowledge graph at siemens</article-title>
          . In: van Erp,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Atre</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Lopez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            ,
            <surname>Srinivas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Fortuna</surname>
          </string-name>
          , C. (eds.)
          <source>Proceedings of the ISWC</source>
          <year>2018</year>
          <article-title>Posters &amp; Demonstrations, Industry and Blue Sky Ideas Tracks co-located with 17th International Semantic Web Conference (ISWC</article-title>
          <year>2018</year>
          ), Monterey, USA, October 8th - to - 12th,
          <year>2018</year>
          .
          <source>CEUR Workshop Proceedings</source>
          , vol.
          <volume>2180</volume>
          .
          <string-name>
            <surname>CEUR-WS.org</surname>
          </string-name>
          (
          <year>2018</year>
          ), http://ceur-ws.org/Vol2180/paper-86.pdf
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Liebig</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maisenbacher</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Opitz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Seyler</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sudra</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wissmann</surname>
          </string-name>
          , J.:
          <article-title>Building a knowledge graph for products and solutions in the automation industry</article-title>
          .
          <source>In: Proceedings of 1st Knowledge Graph Building Workshop co-located with 16th Extended Semantic Web Conference (ESWC)</source>
          , Portoroz, Slovenia, June 3,
          <year>2019</year>
          . CEUR WS Proceedings (to appear) (
          <year>2019</year>
          ), https://openreview.net/pdf?id=ByldIMlEDV
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Monti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perego</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vetere</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gomez-Perez</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alexopoulos</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Webster</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Villazon-Terrazas</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Garcia-Santa</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pan</surname>
            ,
            <given-names>J.Z.</given-names>
          </string-name>
          : Success Stories, pp.
          <volume>215</volume>
          {
          <fpage>236</fpage>
          . Springer International Publishing,
          <string-name>
            <surname>Cham</surname>
          </string-name>
          (
          <year>2017</year>
          ), https://doi.org/10.1007/978-3-
          <fpage>319</fpage>
          -45654-6 8
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Moreau</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Groth</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cheney</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lebo</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Miles</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The rationale of prov</article-title>
          .
          <source>Web Semantics: Science, Services and Agents on the World Wide Web</source>
          <volume>35</volume>
          ,
          <issue>235</issue>
          {
          <fpage>257</fpage>
          (
          <year>2015</year>
          ), http://www.sciencedirect.com/science/article/pii/S1570826815000177
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Noy</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narayanan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Patterson</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , J.:
          <article-title>Industry-scale knowledge graphs: Lessons and challenges</article-title>
          .
          <source>ACM Queue</source>
          <volume>17</volume>
          (
          <issue>2</issue>
          ),
          <volume>20</volume>
          :
          <fpage>48</fpage>
          {
          <fpage>20</fpage>
          :75 (Apr
          <year>2019</year>
          ). https://doi.org/10.1145/3329781.3332266
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Simsek</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          , Karle, E.,
          <string-name>
            <surname>Fensel</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Rocketrml - A nodejs implementation of a usecase speci c RML mapper</article-title>
          .
          <source>In: Proceedings of 1st Knowledge Graph Building Workshop co-located with 16th Extended Semantic Web Conference (ESWC)</source>
          , Portoroz, Slovenia, June 3,
          <year>2019</year>
          . vol. abs/
          <year>1903</year>
          .04969.
          <string-name>
            <surname>CEUR WS</surname>
          </string-name>
          <article-title>Proceedings</article-title>
          (to appear) (
          <year>2019</year>
          ), http://arxiv.org/abs/
          <year>1903</year>
          .04969
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wood</surname>
            ,
            <given-names>D</given-names>
          </string-name>
          . (ed.):
          <source>Linking Enterprise Data</source>
          . Springer (
          <year>2010</year>
          ), http://dblp.unitrier.de/db/books/collections/W2010.html
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>