<!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>Monolith: an OBDM and Knowledge Graph Management Platform</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lorenzo Lepore</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manuel Namici</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giacomo Ronconi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Ruzzi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Valerio Santarelli</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Domenico Fabio Savo</string-name>
          <email>domenicofabio.savo@unibg.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>(a) Sapienza Universita` di Roma</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>(b) OBDA Systems</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this demo we present MONOLITH, a novel application that combines Ontology-based Data Management (OBDM) capabilities with a Knowledge Graph platform. The idea of the system is to provide an integrated environment offering OBDM services such as ontology inspection, query answering, data quality checking, and to couple these services with a Knowledge Graph IDE. Users can access and explore enterprise data through the ontology and build Knowledge Graphs from them, by exploiting the underlying OBDM system. MONOLITH allows to query the Knowledge Graphs through a SPARQL endpoint, to integrate external resources such as Linked Open Datasets, and export the Knowledge Graphs for third-party analytics.1</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Ontology Based Data Management (OBDM) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is a paradigm for data integration
and governance, which enables accessing existing enterprise data sources by means
of a comprehensible and semantically rich representation of the application domain,
expressed by an ontology. OBDM relies on a three-tier architecture: the ontology, the
data sources, and the mappings, which declaratively link the ontology predicates to the
data in the sources. In recent years, the enterprise and industry world have shown a
constantly growing interest in OBDM and its potential deep impacts on ITC scenarios
are widely recognized [
        <xref ref-type="bibr" rid="ref1 ref6 ref8">1, 6, 8</xref>
        ]. Another rising trend in enterprise data management are
Knowledge Graphs (KGs) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. A KG is a map of the data that is available across an
organization, that uses a graph structure (nodes and edges) to highlight the relationships
that exist between the data. These links can be defined in terms of the domain ontology,
providing semantics and meaning to the relationships. The graph model is extremely
flexible, as it can be applied easily to a wide range of use cases, and expandable, making
it easy to integrate new data sources. Also, it abstracts from the underlying application
data stores, meaning that it provides a means to abandon the dreaded data silo approach.
1 Copyright c 2019 for this paper by its authors. Use permitted under Creative Commons
License Attribution 4.0 International (CC BY 4.0).
      </p>
      <p>
        In this demo we present MONOLITH, a novel application developed by OBDA
Systems, a spinoff of Sapienza University of Rome, that combines OBDM capabilities with
a semantic KG platform. The idea is to provide a system which offers OBDM services
such as ontology and mapping inspection, query answering, data quality controls with
respect to the ontology rules, and couples them with a KG IDE. Through semantic data
access provided by the MASTRO OBDM reasoner [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], MONOLITH allows to construct
RDF datasets and build KGs from them. Then, it allows to interrogate the KGs through
a SPARQL endpoint, integrate external resources such as Linked Open Data from the
semantic web, and export the KGs for third-party analytics.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>The Monolith System: architecture and features</title>
      <p>In this section we highlight the architecture and main features of MONOLITH. As
shown in Figure 1, the functionalities provided by MONOLITH can be logically split
into two different macro-areas: one dedicated to managing OWL ontologies and
providing OBDM services through MASTRO, exploiting the mappings between ontology
and database; the other to managing KGs and providing services over them. These two
sections are indeed linked together, allowing to build the KGs through semantic data
access, from the results of the ontology queries computed by MASTRO.</p>
      <p>
        In the Ontology section of the system, users can upload ontologies in OWL 2 and
GRAPHOL [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] format. GRAPHOL is a visual ontology language for OWL 2, whose
distinguishing features are that it allows for drawing ontologies completely
diagrammatically, and that it is equivalent to OWL 2. These ontologies can be navigated by
inspecting the documentation for each entity, in both a wiki-like textual form or through
a custom GRAPHOL viewer, both of which show the entity metadata, and the OWL
axioms they are involved in. Furthermore, users can create, inspect and edit the
mappings, providing for each mapping a datasource connection, and run queries over the
ontologies through an OBDM SPARQL endpoint, producing tabular or RDF datasets.
A Query Catalog allows to store the more significant ontology queries for future re-use.
In Figure 2 we show a screenshot of MONOLITH’s OBDM SPARQL endpoint.
      </p>
      <p>
        Such OBDM query answering services are provided by the MASTRO ontology
reasoner, which supports data access through ontologies specified in logics of the
DLLite family [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In MASTRO, the data source layer is seen as a relational database, and
in those cases in which several, possibly non-relational, sources need to be accessed,
MASTRO can be coupled with a relational data federation tool, which wraps sources
and represents them as a single (virtual) federated relational database. Finally, the
mapping layer is constituted by a set views over the database and mapping assertions [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
which associate ontology elements with such views. By virtue of these design choices,
OBDM services, such as query answering, are realized in MASTRO through a very
efficient technique that reduces them, via query rewriting [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], to standard SQL query
evaluation. In essence, the user query is reformulated with respect to the ontology and
to the mappings, in such a way that a new query, which encodes this reasoning and that
can be directly executed on the relational data sources, is produced.
      </p>
      <p>In the Knowledge Graph section, users can create, import data into, and inspect
their semantic KGs. The RDF datasets that can be imported into a KG can be either the
results of MASTRO SPARQL queries over the ontology, as previously mentioned, or
external datasets, thus allowing the possibility to integrate the data from the enterprise
data sources with Linked Open Data from other organizations or from the Semantic
Web community. For each dataset imported into the KG, the user can choose the named
graph, or context, in the KG into which the RDF triples will be imported. Exploration
of the data in each KG is provided by both a SPARQL endpoint over the KG, or by
a catalog of all the classes in each KG. For each instance of such classes, the system
provides a description, the list of RDF triples it is involved in, and the possibility to
download such triples in RDF format, choosing the desired RDF syntax.</p>
      <p>From a technical standpoint, MONOLITH is developed through the ReactJS
Javascript library, and communicates with the MASTRO Java server for all OBDM
services through a RESTful web service interface. Management of the KGs is delegated
to the Apache Jena framework for Semantic Web and Linked Data applications, and,
specifically, RDF file storage and query is done through the TDB component of Jena.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Application scenarios and Demo Session Overview</title>
      <p>
        We demonstrate MONOLITH through two different specifications. Firstly, the ACI
ontology and RDF datasets, developed in a joint project by Sapienza University of Rome,
the Automobile Club d’Italia (ACI), OBDA Systems, and OKKAM, a spinoff of the
University of Trento. The project goals were the definition of an ontology of ACI’s
Public Vehicle Register (PRA) and car tax domains, the development of an OBDM
system to access the data through such an ontology, and the creation of a web portal2 for
the publication of ACI’s car parc data in Linked Open format. The second
specification is the Movie Ontology [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], which provides a vocabulary to semantically describe
movie related concepts. For this ontology, we have developed a set of mappings for the
MASTRO system to allow for semantic data access through OBDM.
      </p>
      <p>During the demo, attendees will interact with the MONOLITH system in the above
scenarios. They will exploit the OBDM services to inspect the ontology and mapping
specifications and to define queries through the ontology, and will be able to build and
then interrogate semantic KGs from the data extracted from such queries.
Acknowledgments. Work supported by Sapienza under the project “PRE-O-PRE” and
by MIUR, under the SIR project “MODEUS” - grant n. RBSI14TQHQ.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>N.</given-names>
            <surname>Antonioli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Castano</surname>
          </string-name>
          `,
          <string-name>
            <given-names>C.</given-names>
            <surname>Civili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Coletta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Grossi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lembo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Poggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. F.</given-names>
            <surname>Savo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Virardi</surname>
          </string-name>
          .
          <article-title>Ontology-based data access: The experience at the italian department of treasury</article-title>
          .
          <source>In Proc. of CAISE</source>
          <year>2013</year>
          , volume
          <volume>1017</volume>
          <source>of CEUR Workshop Proceedings</source>
          , pages
          <fpage>9</fpage>
          -
          <lpage>16</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>A.</given-names>
            <surname>Bouza</surname>
          </string-name>
          . Mo - the
          <source>movie ontology</source>
          ,
          <year>2010</year>
          . [Online;
          <fpage>26</fpage>
          .
          <string-name>
            <surname>Jan</surname>
          </string-name>
          .
          <year>2010</year>
          ].
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          , G. De Giacomo,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lembo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Poggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rodriguez-Muro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rosati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ruzzi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. F.</given-names>
            <surname>Savo</surname>
          </string-name>
          .
          <article-title>The Mastro system for ontology-based data access</article-title>
          .
          <source>Semantic Web J.</source>
          ,
          <volume>2</volume>
          (
          <issue>1</issue>
          ):
          <fpage>43</fpage>
          -
          <lpage>53</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          , G. De Giacomo,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lembo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Rosati</surname>
          </string-name>
          .
          <article-title>Tractable reasoning and efficient query answering in description logics: The DL-Lite family</article-title>
          .
          <source>J. Autom. Reasoning</source>
          ,
          <volume>39</volume>
          (
          <issue>3</issue>
          ):
          <fpage>385</fpage>
          -
          <lpage>429</lpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>F.</given-names>
            <surname>Di Pinto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lembo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Mancini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Poggi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Rosati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ruzzi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. F.</given-names>
            <surname>Savo</surname>
          </string-name>
          .
          <article-title>Optimizing query rewriting in ontology-based data access</article-title>
          .
          <source>In Proc. of EDBT</source>
          <year>2013</year>
          , pages
          <fpage>561</fpage>
          -
          <lpage>572</lpage>
          . ACM Press,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>M.</given-names>
            <surname>Giese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Soylu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Vega-Gorgojo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Waaler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Haase</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.</surname>
          </string-name>
          <article-title>Jime´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Lanti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Rezk</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>O</given-names>
          </string-name>
          <string-name>
            <surname>¨ . L. O</surname>
          </string-name>
          <article-title>¨ zc¸ep, and</article-title>
          <string-name>
            <given-names>R.</given-names>
            <surname>Rosati</surname>
          </string-name>
          . Optique:
          <article-title>Zooming in on big data</article-title>
          .
          <source>IEEE Computer</source>
          ,
          <volume>48</volume>
          (
          <issue>3</issue>
          ):
          <fpage>60</fpage>
          -
          <lpage>67</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>J. M. Go</surname>
          </string-name>
          <article-title>´mez-Pe´rez</article-title>
          ,
          <string-name>
            <given-names>J. Z.</given-names>
            <surname>Pan</surname>
          </string-name>
          , G. Vetere, and
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          .
          <article-title>Enterprise knowledge graph: An introduction</article-title>
          .
          <source>In Exploiting Linked Data and Knowledge Graphs in Large Organisations</source>
          , pages
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          . Springer,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>E.</given-names>
            <surname>Kharlamov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hovland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Skjaeveland</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bilidas</surname>
          </string-name>
          ,
          <string-name>
            <surname>E.</surname>
          </string-name>
          <article-title>Jime´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Soylu</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Lanti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Rezk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Zheleznyakov</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Giese</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Lie</surname>
            ,
            <given-names>Y. E.</given-names>
          </string-name>
          <string-name>
            <surname>Ioannidis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Kotidis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Koubarakis</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Waaler</surname>
          </string-name>
          .
          <article-title>Ontology based data access in statoil</article-title>
          .
          <source>J. Web Semant</source>
          .,
          <volume>44</volume>
          :
          <fpage>3</fpage>
          -
          <lpage>36</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>D.</given-names>
            <surname>Lembo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Pantaleone</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Santarelli</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. F.</given-names>
            <surname>Savo</surname>
          </string-name>
          .
          <article-title>Easy OWL drawing with the graphol visual ontology language</article-title>
          .
          <source>In Proc. of KR</source>
          , pages
          <fpage>573</fpage>
          -
          <lpage>576</lpage>
          . AAAI Press,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>M.</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          .
          <article-title>Managing data through the lens of an ontology</article-title>
          .
          <source>AI Magazine</source>
          ,
          <volume>39</volume>
          (
          <issue>2</issue>
          ):
          <fpage>65</fpage>
          -
          <lpage>74</lpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>