<!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>Ontology-based data access with MASTRO</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Antonella Poggi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Ruzzi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Informatica e Sistemistica “Antonio Ruberti” Universita` di Roma “La Sapienza” - Via Salaria</institution>
          <addr-line>113, I-00198 Roma</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In several areas, such as Enterprise Application Integration, Data Integration [5], and the Semantic Web [4], clients need to access the services exported by the system, and hence require a representation of the intensional level of the application domain in terms of which they can specify the access to the exported services. One of the most interesting usages of such a shared conceptualization is ontology-based data access, where a conceptual layer is exported to the client, abstracting away from how actual data is maintained. Therefore, an ontology-based data access system has to adress the “impedance mismatch” issue, existing between data actually present at the sources, and objects represented at the intensional level. In this demo, we present MASTRO, an ontology-based data access system that extends the QuOnto system [1] with new capabilities and uses the QuOnto engine at its core. Specifically, MASTRO provides tractable reasoning over an ontology, laying over an autonomous relational DBMS managing the data layer. In what follows, we introduce the main services provided by MASTRO, namely (i) ontology specification, (ii) query answering, (iii) ontology satisfiability, and (iv) meta-query answering. The present work is one of the outcomes of the European project TONES1. Ontology specification MASTRO allows to define an ontology in terms of both an intensional and an extensional level. The former is specified by means of a new Description Logic in the DL-Lite family [3], called DL-LiteA 2. Thus, the domain of interest is represented in terms of (i) concepts, denoting set of objects, (ii) roles, denoting binary relations between objects, and, notably, (iii) domain values, denoting set of values. Interestingly, values allow both concepts and roles to be qualified by attributes. Concerning the ontology extensional level, MASTRO allows for mappings specification, that establish how data retrieved from an existing database DB is related to extensions of terms used in the ontology intensional level. This is achieved by (i) allowing object terms to denote constants, that are built by applying Skolem functors to data values, (ii) defining mappings of the form: Ψ ϕ, where Ψ is an arbitrary SQL query over DB, and ϕ is a DL-LiteA conjunctive query without existential variables, whose atoms may contain variable object terms, i.e. terms obtained by applying Skolem functors to variables denoting values. Query answering The MASTRO query answering service is similar to query answering provided by QuOnto [1]. In particular, MASTRO is able to answer unions of conjunctive queries (UCQs) expressed over the ontology alphabet: the class of UCQs is one of the most important classes of query arising in practical cases. The query answering process is performed by query rewriting and strongly separates the intensional level from 1 http://www.tonesproject.org/ 2 Please, for details about DL-LiteA constructs and assertions, refer to [2, 6].</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>the extensional one: user queries are first reformulated on the basis of the TBox
assertions, and then evaluated directly over the database by means of the mappings. Hence,
the TBox assertions are “compiled” into the query, so the TBox can be disregarded
during the query evaluation phase. MASTRO also provides two different mapping
handling techniques. The first one exploits the SQL engine of the DBMS managing the data
layer of the ontology: a view is defined for every general concept, using the SQL query
specified into the mapping assertion. The second one unfolds the query by producing
an SQL statement that can be directly issued over the source tables.</p>
      <p>Ontology satisfiability Instance checking, concepts subsumption and ontology
satisfiability are particularly important reasoning tasks. It can be shown that both
instance checking and concepts subsumption can be reduced to ontology satisfiability.
The MASTRO system provides an efficient ontology satisfiability algorithm which is
also used to decide instance checking and concepts subsumption.</p>
      <p>Metaquerying MASTRO maintains the ontology metalevel information into a local
data structure called Metadata Repository (MDR). Such a metalevel is itself represented
by means of a DL-LiteA ontology. This enables the MASTRO system to provide some
metalevel reasoning services. In particular, a query answering service is provided for
answering queries expressed over the ontology metalevel.</p>
      <p>Demo Scenario To illustrate the main features of MASTRO and test services provided
by the system, we defined an example ontology representing administrative and didactic
information about students and teachers, students’ master degree thesis, faculties and
courses. We then mapped such ontology over an actual large database instance of the
University of Rome “La Sapienza”: the database stores information within 27 different
tables, with an overall size of 200.000 tuples. We tested the satisfiability of the example
ontology and evaluated several queries of practical interest: the results clearly show that
MASTRO performs well also with very large underlying databases.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Andrea</given-names>
            <surname>Acciarri</surname>
          </string-name>
          , Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Mattia Palmieri, and
          <string-name>
            <given-names>Riccardo</given-names>
            <surname>Rosati</surname>
          </string-name>
          . QUONTO:
          <article-title>QUerying ONTOlogies</article-title>
          .
          <source>In Proc. of AAAI</source>
          <year>2005</year>
          , pages
          <fpage>1670</fpage>
          -
          <lpage>1671</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Antonella Poggi, and
          <string-name>
            <given-names>Riccardo</given-names>
            <surname>Rosati</surname>
          </string-name>
          .
          <article-title>Linking data to ontologies: The description logic dl-litea</article-title>
          .
          <source>In Proc. of the 2nd Workshop on OWL: Experiences and Directions (OWLED</source>
          <year>2006</year>
          ),
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and
          <string-name>
            <given-names>Riccardo</given-names>
            <surname>Rosati</surname>
          </string-name>
          .
          <article-title>DL-Lite: Tractable description logics for ontologies</article-title>
          .
          <source>In Proc. of AAAI</source>
          <year>2005</year>
          , pages
          <fpage>602</fpage>
          -
          <lpage>607</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Jeff</given-names>
            <surname>Heflin</surname>
          </string-name>
          and
          <string-name>
            <given-names>James</given-names>
            <surname>Hendler</surname>
          </string-name>
          .
          <article-title>A portrait of the Semantic Web in action</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          ,
          <volume>16</volume>
          (
          <issue>2</issue>
          ):
          <fpage>54</fpage>
          -
          <lpage>59</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Maurizio</given-names>
            <surname>Lenzerini</surname>
          </string-name>
          .
          <article-title>Data integration: A theoretical perspective</article-title>
          .
          <source>In Proc. of PODS</source>
          <year>2002</year>
          , pages
          <fpage>233</fpage>
          -
          <lpage>246</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Antonella</given-names>
            <surname>Poggi</surname>
          </string-name>
          .
          <article-title>Structured and Semi-Structured Data Integration</article-title>
          .
          <source>PhD thesis</source>
          , Dip. di Inf. e Sist., Univ. di Roma “La Sapienza”,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>