<!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>Design and Development of a Polystore System for Heterogeneous Biomedical Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mirco Cazzaro</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Information Engineering, University of Padova</institution>
          ,
          <addr-line>Via Gradenigo 6/B, Padova, 35131</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>Biomedical data management is increasingly complex due to the variety of storage systems and evolving data models. This heterogeneity presents obstacles to data integration and querying, crucial for advancing biomedical research and healthcare. A possible solution is to employ a recent idea in the database field: polystores. A polystore is a DBMS designed to integrate and manage multiple heterogeneous data stores, allowing for eficient data processing and querying across diverse data models and storage systems. Nevertheless, polystore systems may difer profoundly one with the other, both in their structure and in the interface provided to the users: this is usually due to the diverse landscapes where polystores may be applied, and thus the diverse nature of data available in diferent fields, and to the information needs that users may have. These limitations impede the adoption of existing polystores in the context of biomedical data. Moreover, as far of our knowledge, there exist no system ofering an integrated viewpoint to biomedical data by means of a graph data model, which would instead provide a sharpened representation of this domain. In this paper, we outline the research challenges and the initial steps towards the development of a polystore system that provides eficient access to multiple heterogeneous biomedical data sources, addressing also critical privacy concerns by tracing data oflw and ensuring the privacy and anonymity of individuals.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Data Integration</kwd>
        <kwd>Data Federation</kwd>
        <kwd>Polystore Systems</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>Managing biomedical data poses significant challenges. Practitioners are confronted with numerous
disparate storage systems, each employing diferent data models that may evolve over time. This leads
to a high degree of heterogeneity, where the same data domain can be represented using various models
such as relational, hierarchical or graph-based. In particular, graphs are highly used for biomedical
data, because their structure naturally mirrors the complex and interconnected relationships found in
biological systems. Moreover, these systems are often managed by diferent Database Management
Systems (DBMSs). Additionally, the data is described by diverse metadata schemas, leading to more
heterogeneity. This low level of integration hinders the possibility of querying them together and infer
new knowledge, unless experts manually integrate them, by defining a unified data model, achieving
consensus among data stakeholders, manually matching existing data to this new model, migrating
data accordingly, and then modifying applications to adapt to changes in the used query language. All
these steps are time-consuming and expensive.</p>
      <p>At the European level, numerous contexts exist where the aforementioned challenges are relevant.
Specifically, the Department of Information Engineering at the University of Padova leads the EU project
HEREDITARY, which involves collaboration with three medical centers, encompassing heterogeneous
multimodal clinical and genomic data, which require integration. HEREDITARY underscores the
pressing demand for a robust and eficient system capable of seamlessly integrating diverse biomedical
datasets.</p>
      <p>A possible solution is to employ a recent advancement in the database field: polystores. A polystore
is a system that integrates multiple heterogeneous databases (SQL, NoSQL, graph, document stores, etc.)
under a unified query interface. It enables querying data across diferent types of databases without
physically moving or transforming the data. Polystores uses a query federation approach, where queries
are translated and executed across diferent underlying databases, leveraging their native query engines.</p>
      <p>
        The state of the art is represented by BigDAWG [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], developed within the Intel Science and Technology
Center on Big Data. BigDAWG’s architecture consists of four main layers: the base layer, which includes
diverse physical data stores such as relational databases and column-oriented DBMS; the island layer,
containing independent software components designed to facilitate querying across diferent database
types; the main BigDAWG layer, which manages query processing and dispatching; and the application
layer, responsible for user interaction. Despite being well documented1, BigDAWG functions more as a
prototype, requiring significant efort to adapt to our needs. Another relevant system is CloudMdsQL [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],
which also aims at querying heterogeneous data sources in cloud environments. However, CloudMdsQL
presents several limitations that make it unsuitable for our purposes. Firstly, it supports queries
primarily against unimodal databases, focusing mainly on tabular data, which limits its applicability
to more diverse or multimodal data environments. Secondly, it relies on an ad-hoc query language,
which necessitates additional training and efort from end-users, hindering ease of adoption. Finally,
CloudMdsQL employs a Global-As-View (GAV) approach for schemas integration, which significantly
increases maintenance overhead due to the complexity and rigidity of maintaining global views when
underlying data schemas evolve.
      </p>
      <p>
        Considering other polystore solutions, among the most interesting and actively maintained academic
projects is Polypheny [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. This open-source project appears promising but is still in the early stages of
development and has a limited user base, raising concerns about its future sustainability and continued
development. Additionally, Polypheny currently lacks essential features such as a logging system,
user management capabilities, and support for graph data, crucial aspects for a polystore intended for
application within the biomedical domain.
      </p>
      <p>
        Another relevant aspect is how integrated data is modeled. As mentioned before, a graph-based
data model is necessary to represent the intricate pattern of such a complex domain: this translates
into the need of an ontology through which data is accessed. The Ontology-Based Data Access
(OBDA) paradigm [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] combines the capabilities of polystore systems with those of graph databases.
OBDA leverages ontologies to introduce a semantic layer, providing a conceptual representation that
significantly simplifies data querying and interpretation. Moreover, ontologies enhance graph databases
with inferential algorithms, enabling the derivation of new knowledge from existing data. OBDA acts
by means of mappings, through which ontology patterns described in SPARQL queries are unfolded
into relational queries.
      </p>
      <p>This paper’s sections are organized as follows: section 2 and 3 describe in details both the approach
and the proposed framework, analyzing how its structures allows to tackle our challenges. Section 4
derives instead open research questions coming from the framework weaknesses, and how we plan to
address them; section 5 concludes the paper.</p>
    </sec>
    <sec id="sec-2">
      <title>2. OBDF: OBDA + Data Federation</title>
      <p>
        Recent advancements in the research proposed a novel approach to polystores: the Ontology-Based Data
Federation (OBDF) paradigm [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This paradigm is the result of combining the standard OBDA paradigm
on top of a Data Federation system (e.g. Denodo, Dremio), through which it is possible to combine
multiple data models into a Virtual Database (VDB), without duplicating or re-materializing data but
rather relying on local DBMSs, accessing data in a streaming fashion. Figure 2 represent how a query in
OBDF is transformed from its semantic form into multiple independent queries across the data sources,
potentially in diferent formats, depending on the respective source type (e.g. relational, hierarchical,
graph, etc.). To set up an OBDF-based infrastructure, users are required to have (or design) an ontology
that models the domain of interest: ontological axioms are exploited at query time to explicitly retrieve
      </p>
      <sec id="sec-2-1">
        <title>1https://bigdawg-documentation.readthedocs.io/en/latest/</title>
        <p>
          implicit results. In many OBDA implementations (e.g. Ontop [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]), this process is the result of multiple
phases, where the query undergoes through multiple rewriting [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] phases, each of which produces
an Intermediate Query (IQ). Users then have to define mappings between the ontology and the VDB.
Although there exist many standard languages that allows to define mappings (e.g. RML, R2RML, Ontop
Native), they share inherent properties: target ontological triples are matched with placeholders, that
must correspond to the source VDB queries fields. By allowing to perform semantic queries over a
graph data model, OBDF capabilities aligns perfectly with the HEREDITARY WP3 Federated Analytics
task requirements, where multiple data sources with diferent models feeds data to the consortium
without duplicating it, as a necessary condition for guaranteeing user’s privacy and anonymity.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Federated Architecture Infrastructure</title>
      <p>Identifying functional requirements is essential to shape the research design, workflow, and system
architecture. These requirements are fundamental to shape the system architecture and to drive the
choice of the diferent components. To address them, we explore the detailed design components
essential for setting up a system that meets the project objectives. In Figure 3, we show how diferent
components plug together: the SPARQL endpoint, the OBDA Data Integration platform (with ontology
and mappings) and the Data Virtualization and Federation layer. In this section we will inspect each
of these layers from a bottom-up perspective and we will discuss the implementation choices. There
exist diferent solutions implementing a VDB such as Denodo 2, which although it is very robust, is
an enterprise solution. An alternative is Dremio3, which supports several sources, and allows for the
development of custom adapters for unsupported sources. Considering that Dremio is open-source,
we will focus on it as our federation component. Going into details, Dremio is a VDB with several
features: it is as a data virtualization system that enables seamless access to data across various storage
systems like RDBMSs, NoSQL databases and cloud storage without duplicating data, thereby optimizing
query performance. The platform also includes a user management system that allows administrators
to control access and manage permissions efectively, ensuring that data is accessible only to authorized
personnel and facilitating collaboration. Additionally, Dremio incorporates a robust logging system,
2https://www.denodo.com/en
3https://www.dremio.com/</p>
      <p>MAIN
SERVER</p>
      <p>OBDA
DATA FEDERATION</p>
      <p>HERO
Genomics
MAPPINGS</p>
      <p>Network</p>
      <p>Relational
Columnoriented</p>
      <p>Hierarchical
which is essential for recording user activities and troubleshooting. This logging capability helps in
analyzing usage patterns and tracking data flow.</p>
      <p>
        Diferent OBDA systems have been implemented within time to support SPARQL-to-SQL translations.
However, recent studies focused on comparing performances between Mastro and Ontop, as they are
among the few OBDA systems which support ontology reasoning. In general, Mastro shown faster
responses in scenarios [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] requiring extensive in terms of timings, while Ontop performs better in
scenarios where a considerable number of mappings is involved for unfolding a certain query. This
means that a choice on which system fits better depends on how constraining are timings in the query
processing phase and on how many mappings have to be unfolded on average, that strictly depends
on the heterogeneity of the underlying relational source. In our early setup, we chose Ontop as our
OBDA component, as long as at this stage it is still unknown which are the requirements in terms of
mappings needed, while it is known to us the research team behind it is already investigating possible
optimizations when employed in a federated setup. Also, Ontop supports the R2RML standard, allowing
to migrate seamlessly to another system, if necessary.
      </p>
      <p>
        Between these, an ontology must act as a shared dictionary. As a first step towards the integration of
heterogeneous data, the HEREDITARY consortium provided the genomic component of the HEReditary
Ontology (HERO) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. We also defined mappings between the ontology and a VDB schema covering the
genomic domain (samples, variants, zygosities, etc.).
      </p>
    </sec>
    <sec id="sec-4">
      <title>4. Research Challenges</title>
      <p>Considering the connection points between HEREDITARY challenges and OBDF key features, our plan
is to adopt it as the backbone of our polystore. Nevertheless, this does not come without challenges. In
this section we present preliminary results from an initial implementation of an OBDF-based polystore
system, focusing on bottlenecks and hurdles we encountered in the process we aim to tackle.</p>
      <p>Query Optimization We set up a federated environment with two data sources hosting genomic
data, and we federate them in an OBDF setup, choosing Ontop as the OBDA layer, and Dremio as the
Data Federation layer. Then, we derived 4 query of interest in the domain of genomics, in particular
mimicking those provided by Beacon V24 for variants discovery. We ran each of these multiple times,
recording timings for each execution phase, and we then computed average and standard deviation.
Figure 4 showcases a portion of our results. As it is instantly evident, there is a huge bottleneck in
the last phase, namely the Dremio Running phase. What we observed is that queries that come out
from the OBDA layer present an unnecessary amount of self joins, that could possibly collapse into
a single interrogation, grouped by identical queries. Moreover, cross join between federated sources
are performed, retrieving uselessly the whole databases from the sources multiple times, often risking</p>
      <sec id="sec-4-1">
        <title>4https://docs.genomebeacons.org/variant-queries/</title>
        <p>
          to fill the available memory. This occurs because OBDA systems have traditionally been designed for
single-source scenarios and have not been optimized for federated settings. Recently, new research
advancements [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] have proposed some optimization strategies that we aim to adopt to reduce execution
bottlenecks. Another crucial aspect regards the choice of the Data Federation VDB component. Here,
we need a system that exploits eficiently sources indexes and data structures, and that provides eficient
functions necessary to realize the translation from relations to triples (e.g. IRI encoding).
        </p>
        <p>Mapping Accuracy How mappings between the ontology and the VDB are defined is paramount.
Although automatic mapping bootstrapping tools are available, they usually operate in a classical OBDA
scenario. Hence, in a federated context, especially in a sophisticated domain such as the biomedical one,
it is essential to have an human agent manually defining them. This process is inherently error-prone,
and thus it will be necessary to put into action accuracy estimation techniques. Recent advancements
in the research [11] proposed a novel approach to estimate KG accuracy using sampling strategies and
providing estimates within confidence intervals. We plan to extend these techniques also in the domain
of Virtual Knowledge Graphs, to assess their accuracy with respect to the original data sources, and
thus to determine mappings quality.</p>
        <p>System Accessibility The aim of having a Federated Analytics infrastructure is providing to project
partners all the tools and the services to get access to the data in a streamlined way. This means that on
top of the architecture, an user-friendly interface should be available to the audience. We plan to do this
by means of a web application. This application will not only ease data retrieval, but will allow to export
query results in many formats. Additionally, a comprehensive logging system will monitor data access,
contributing to explainability. As a preliminary result, we efectively set up a web portal allowing to
interact with the aforementioned embryonal OBDF-based setup5 for genomic variant discovery.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusions and Future Works</title>
      <p>In this paper, we have discussed the challenges posed by the management and integration of
heterogeneous biomedical data. We have critically evaluated existing polystore and OBDA solutions, highlighting
their limitations in meeting the complex requirements of the biomedical domain. Consequently, we
proposed adopting the OBDF approach, combining OBDA techniques and Data Federation technologies.
We described an initial implementation leveraging Dremio as a federated virtualization layer and Ontop
as the semantic integration engine, showcasing preliminary results within the genomic domain. Our
analysis identified critical performance bottlenecks, inaccuracies in ontology-data mappings, and the
need for improved system accessibility. In future work, we aim to address the identified challenges.
Specifically, we will investigate query optimization techniques to reduce computational bottlenecks in
federated query execution, develop methods to rigorously estimate and improve mapping accuracy,
and design intuitive user interfaces complemented by logging and privacy-preserving mechanisms. By
addressing these aspects, we will significantly advance toward an eficient and accessible polystore
solution tailored for biomedical research requirements.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This project has received funding from the HEREDITARY Project, as part of the European Union’s
Horizon Europe research and innovation programme under grant agreement No GA 101137074.</p>
    </sec>
    <sec id="sec-7">
      <title>Declaration on Generative AI</title>
      <sec id="sec-7-1">
        <title>The authors have not employed any Generative AI tools.</title>
        <p>Rules and Reasoning, Bucharest, Romania, September 16-18, 2024, volume 3816 of CEUR Workshop
Proceedings, CEUR-WS.org, 2024. URL: https://ceur-ws.org/Vol-3816/paper73.pdf.
[11] S. Marchesin, G. Silvello, Eficient and reliable estimation of knowledge graph accuracy, Proc.</p>
        <p>VLDB Endow. 17 (2024) 2392–2404. URL: https://www.vldb.org/pvldb/vol17/p2392-marchesin.pdf.
doi:10.14778/3665844.3665865.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>V.</given-names>
            <surname>Gadepally</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Duggan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Elmore</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Haynes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kepner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Madden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mattson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stonebraker</surname>
          </string-name>
          ,
          <article-title>The bigdawg polystore system and architecture</article-title>
          ,
          <source>in: 2016 IEEE High Performance Extreme Computing Conference, HPEC</source>
          <year>2016</year>
          ,
          <article-title>Waltham</article-title>
          , MA, USA, September
          <volume>13</volume>
          -
          <issue>15</issue>
          ,
          <year>2016</year>
          , IEEE,
          <year>2016</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . URL: https://doi.org/10.1109/HPEC.
          <year>2016</year>
          .
          <volume>7761636</volume>
          . doi:
          <volume>10</volume>
          .1109/HPEC.
          <year>2016</year>
          .
          <volume>7761636</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Kolev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Bondiombouy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Valduriez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jiménez-Peris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Pau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pereira</surname>
          </string-name>
          ,
          <article-title>Design and implementation of the cloudmdsql multistore system</article-title>
          ,
          <source>in: CLOSER 2016 - Proceedings of the 6th International Conference on Cloud Computing and Services Science</source>
          , Volume
          <volume>1</volume>
          , Rome, Italy,
          <source>April 23-25</source>
          ,
          <year>2016</year>
          , SciTePress,
          <year>2016</year>
          , pp.
          <fpage>352</fpage>
          -
          <lpage>359</lpage>
          . URL: https://doi.org/10.5220/0005923803520359. doi:
          <volume>10</volume>
          .5220/0005923803520359.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Vogt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stiemer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Schuldt</surname>
          </string-name>
          , Polypheny-db:
          <article-title>Towards a distributed and self-adaptive polystore</article-title>
          ,
          <source>in: IEEE International Conference on Big Data (IEEE BigData</source>
          <year>2018</year>
          ), Seattle, WA, USA, December
          <volume>10</volume>
          -
          <issue>13</issue>
          ,
          <year>2018</year>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>3364</fpage>
          -
          <lpage>3373</lpage>
          . URL: https://doi.org/10.1109/BigData.
          <year>2018</year>
          .
          <volume>8622353</volume>
          . doi:
          <volume>10</volume>
          . 1109/BIGDATA.
          <year>2018</year>
          .
          <volume>8622353</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. D.</given-names>
            <surname>Giacomo</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>R.</given-names>
            <surname>Rosati</surname>
          </string-name>
          ,
          <article-title>Ontology-based database access</article-title>
          ,
          <source>in: Proceedings of the Fifteenth Italian Symposium on Advanced Database Systems, SEBD</source>
          <year>2007</year>
          ,
          <volume>17</volume>
          -
          <fpage>20</fpage>
          June 2007,
          <string-name>
            <given-names>Torre</given-names>
            <surname>Canne</surname>
          </string-name>
          , Fasano,
          <string-name>
            <surname>BR</surname>
          </string-name>
          , Italy,
          <year>2007</year>
          , pp.
          <fpage>324</fpage>
          -
          <lpage>331</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Gu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Calvanese</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Panfilo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lanti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mosca</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          <article-title>Xiao, OBDF: OBDA + data federation - extended abstract</article-title>
          ,
          <source>in: 40th International Conference on Data Engineering</source>
          , ICDE 2024 - Workshops, Utrecht, Netherlands, May
          <volume>13</volume>
          -16,
          <year>2024</year>
          , IEEE,
          <year>2024</year>
          , pp.
          <fpage>381</fpage>
          -
          <lpage>383</lpage>
          . URL: https://doi.org/10.1109/ ICDEW61823.
          <year>2024</year>
          .
          <volume>00060</volume>
          . doi:
          <volume>10</volume>
          .1109/ICDEW61823.
          <year>2024</year>
          .
          <volume>00060</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rodriguez-Muro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kontchakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          ,
          <article-title>Ontology-based data access: Ontop of databases</article-title>
          ,
          <source>in: The Semantic Web - ISWC 2013 - 12th International Semantic Web Conference</source>
          , Sydney,
          <string-name>
            <surname>NSW</surname>
          </string-name>
          , Australia,
          <source>October 21-25</source>
          ,
          <year>2013</year>
          , Proceedings,
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , volume
          <volume>8218</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2013</year>
          , pp.
          <fpage>558</fpage>
          -
          <lpage>573</lpage>
          . URL: https://doi.org/10.1007/978-3-
          <fpage>642</fpage>
          -41335-3_
          <fpage>35</fpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>642</fpage>
          -41335-3\_
          <fpage>35</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Rodriguez-Muro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kontchakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          ,
          <article-title>Query rewriting and optimisation with database dependencies in ontop</article-title>
          ,
          <source>in: Informal Proceedings of the 26th International Workshop on Description Logics</source>
          , Ulm, Germany,
          <source>July 23 - 26</source>
          ,
          <year>2013</year>
          , volume
          <volume>1014</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>917</fpage>
          -
          <lpage>929</lpage>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>1014</volume>
          /paper_24.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Namici</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. D.</given-names>
            <surname>Giacomo</surname>
          </string-name>
          ,
          <article-title>Comparing query answering in OBDA tools over w3c-compliant specifications</article-title>
          ,
          <source>in: Proceedings of the 31st International Workshop on Description Logics</source>
          , Tempe, Arizona,
          <string-name>
            <surname>US</surname>
          </string-name>
          ,
          <source>October 27th - 29th</source>
          ,
          <year>2018</year>
          , volume
          <volume>2211</volume>
          <source>of CEUR Workshop Proceedings, CEUR-WS.org</source>
          ,
          <year>2018</year>
          . URL: https://ceur-ws.
          <source>org/</source>
          Vol-
          <volume>2211</volume>
          /paper-25.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Cazzaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. G.</given-names>
            <surname>Gut</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Menotti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rueda</surname>
          </string-name>
          , G. Silvello,
          <article-title>Hero-genomics: An ontology for integration and access of multicenter genomic data</article-title>
          ,
          <source>in: 16th International Conference on Semantic Web Applications and Tools for Health Care and Life Sciences, SWAT4HCLS</source>
          <year>2025</year>
          , Barcelona, Spain, February 24th to 27th,
          <year>2025</year>
          . URL: http://www.dei.unipd.it/~menottilau/papers/25-CGMRS-SWAT4HCLS.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>M. D. Panfilo</surname>
          </string-name>
          ,
          <article-title>Towards optimizing ontology-based data federation: Performance insights from experimental studies</article-title>
          ,
          <source>in: Companion Proceedings of the 8th International Joint Conference on</source>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>