<!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 Query Formulation and Query-Driven Ontology Extensions in OBDA Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>B. Cuenca Grau</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>M. Giese</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>I. Horrocks</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>T. Hubauer</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>E. Jime´nez-Ruiz</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>E. Kharlamov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>M. Schmidt</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>A. Soylu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>D. Zheleznyakov</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, University of Oxford</institution>
          ,
          <addr-line>Oxford</addr-line>
          <country country="UK">UK</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Informatics University of Oslo</institution>
          ,
          <country country="NO">Norway</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Siemens Corporate Technology</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>fluid Operations AG</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The process of translating end-users' information needs into executable and optimised queries over the data is the main problem that end-users face in Big Data scenarios. In this paper we present the recently started EU project Optique, which advocates for a next generation of the well known Ontology-Based Data Access (OBDA) approach to address this problem. We discuss challenges, present ongoing work, and our current preliminary solutions with regards to the query formulation and query-driven ontology extension.</p>
      </abstract>
      <kwd-group>
        <kwd>Ontology-Based Data Access</kwd>
        <kwd>Query Formulation</kwd>
        <kwd>Ontology Navigation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Massive amounts of data have been accumulated over decades; moreover, data keeps
increasing fast; and it is spread over a vast variety of formats and sources, being
modeled using different conceptualisations of the domain, often using schemata that are
optimized for efficient processing rather than for intuitive access. These three aspects
go hand in hand with the volume, velocity, and variety dimensions of Big Data [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Accessing the relevant data in this context is becoming increasingly difficult for
end-users. For example, in large enterprises, such as Statoil,5 end-users work with
applications that allow accessing data through a limited set of predefined queries. In
situations where an end-user needs data that these predefined queries do not provide, the
help of IT-experts (e.g., database managers) is required. The IT-experts need to
translate the end-users’ information needs into suitable queries and this process may require
several iterations. In particular in the oil and gas industry, IT-experts spend 30–70%
of their time gathering and assessing the quality of data [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This is clearly very
expensive in terms of both time and money. The Optique project6 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] advocates for the
well-known Ontology-Based Data Access (OBDA) approach (e.g., [
        <xref ref-type="bibr" rid="ref2 ref20">20, 2</xref>
        ]) to address
the bottlenecks that end-users face when accessing Big Data and aims at solutions that
significantly reduce the cost of data access.
5 Statoil ASA is an oil and gas company and it is one of the uses case scenarios in Optique,
which aims in particular at providing access to data for geologists, petrophysicists, etc.
6 http://www.optique-project.eu/
      </p>
      <p>end-user
Application
r
e
s
u
lt
s
q
u
e
r
y</p>
      <p>IT-expert
Ontology</p>
      <p>Mappings
Query Answering</p>
      <p>...
heterogeneous
data sources
r
e
s
u
lt
s
q
u
e
r
y
OBDA systems have the potential to address the data access problem by
presenting a general ontology-based and end-user oriented query interface over heterogeneous
data sources. The core elements in a classical OBDA system (Figure 1, left) are an
ontology, which describes the application domain in terms of user-oriented vocabulary
of classes (usually referred as concepts) and relationships between them (usually
referred as roles), and a set of mappings, which relates the terms in the ontology and the
schema of the underlying data sources. End-users formulate queries using the terms
defined by the ontology, which should correspond to their view of the domain, and thus,
they are not required to understand the data source schemata. For example, in the
Statoil use case the ontology would provide concepts such as WellBores, their purpose,
etc., while the mappings would associate SQL queries to each term of the ontology
vocabulary, i.e., similarly to SQL view definitions. For example, the ontology concept
Water Injection Wellbore would be mapped to the SQL query:</p>
      <p>SELECT *
FROM DevelopmentWellBore</p>
      <p>WHERE purpose=Injection and content=Water
To be precise, one should extend this mapping with a reification function that transforms
tuples returned by the query above into constants, i.e, exact identifiers of water injection
wellbores. Another alternative is to adjust the query by changing the select clause to the
following: SELECT ID.</p>
      <p>State-of-the-art OBDA systems that are based on classical OBDA architecture
(Figure 1, left), however, have shown among others the following four limitations.
1. The usability of OBDA systems regarding the user interface is still an open issue.</p>
      <p>Even if the vocabulary provided by the ontology is familiar to end-users, they may
find difficult to formulate complex queries when several concepts and roles are
involved.
2. OBDA systems critically depend on a suitable ontology and the corresponding set
of mappings, which are in practice expensive to obtain. Even if we assume that
the ontology and the mappings are given, they are not static artifacts and should
evolve according to the new end-users’ information requirements. Both
bootstrapping of ontologies and mappings for an initial installation of OBDA systems and
subsequent maintenance are challenging topics which are still in a premature stage.
3. Treatment of query answering is usually limited to query rewriting and there is little
support of distributed query optimisation and processing in OBDA systems.
4. Streaming, e.g., sensor, data and corresponding analytical tools are generally
ignored by OBDA systems, which seriously limits their applicability in enterprises
such as Statoil.</p>
      <p>The Optique project, which started in November 2012 and has a four years time
span, aims at addressing these four limitations by developing a next generation OBDA
system that targets the demands of today’s Big Data challenges. The core components
of the Optique’s OBDA solution are presented in Figure 1, right: (i) query formulation,
(ii) ontology and mapping management, (iii) query transformation, and (iv) distributed
query optimisation and processing. Besides the core components, Optique’s OBDA
system integrates both data streams and databases, and supports data analytics.</p>
      <p>In this paper we focus on the first and partially the second limitation above. More
specifically, we focus on the query formulation component of Optique’s solution. We
will also discuss the query-driven ontology extension sub-component of the query
formulation component which in fact partially addresses issues of the second limitation
(ontology maintenance). In the following sections we discuss challenges, introduce our
ongoing work, and illustrate our preliminary solutions. Moreover, we present an
envisaged architecture of our query formulation component.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Challenges in Query Formulation</title>
      <p>The ontology in an OBDA system, as already mentioned, is intended to provide a
useroriented conceptual model of the domain. This allows users to formulate queries
using familiar terms and shields from understanding the structure of the underlying data
sources. However, in order to provide the necessary power and flexibility, the required
query language will inevitably be rather complex and it would be unrealistic to expect
all end-users to formulate queries directly in such a query language.</p>
      <p>
        In Optique we advocate for a query by navigation (QbN) approach combined with
faceted search to address the usability problem. We refer interested readers to [
        <xref ref-type="bibr" rid="ref10 ref17 ref21 ref23">23, 17,
10, 21</xref>
        ] for some state-of-the-art solutions. There are, however, two important
conceptual challenges related to the query by navigation approach: (i) representation paradigms
for ontologies, and (ii) correlations between navigation and query construction. We will
now elaborate on these challenges.
      </p>
      <p>Representation paradigms. Query by navigation approaches usually combine
navigational search and faceted search techniques over an underlying ontology graph (or any
other kind of structured knowledge). Thus, in this scenario, the ontology not only
provides the domain vocabulary but also guides the end-user to formulate complex queries.
Existing approaches, however, are mostly dominated with one type of representation
paradigm (e.g., forms, diagrams etc.), hence limited to the confines of a particular
model. We believe that multiple representation paradigms should be used in
collaboration where each paradigm is responsible for the tasks for which it is best suited.</p>
      <p>We have also observed that current solutions do not adequately employ a very
important paradigm, namely the graph representation metaphor of OWL ontologies. The
formal underpinning of OWL (and its revision OWL 2) is provided by Description
Logics (DLs) where the fundamental modelling concept is an axiom (i.e., a logical statement
relating roles and/or concepts). This is a key difference from traditional graph-based
knowledge representation paradigms (e.g., semantic networks). OWL ontologies may
include complex axioms and concept constructors such as universal restrictions that do
not have a direct representation in a graph structure.</p>
      <p>Correlations between navigation and query construction. Given a navigation paradigm,
one has to understand how the actual navigation influences the construction of a query.
More precisely, how the navigation corresponds to operators in a given query language.
For example, how to form a query with negation, disjunction, or aggregation via a graph
navigation? For navigation over graphs there is a natural correspondence to conjunctive
queries: moving along a graph can be seen as an extension of the corresponding query
with more conjuncts corresponding to the (labels of) edges and nodes met on the way.
This correspondence gives good opportunities for designing QbN algorithms. For other
types of queries, however, establishing the correlation is a challenging problem that will
require further research.</p>
      <p>The representation paradigms and the correlation between navigation and query
construction give two dimensions of choices for query by navigation approaches.
Orthogonally, the ontology and query languages give another two dimensions to choose
from. In the following we elaborate on the OWL 2 QL ontology language and queries
that essentially correspond to a conjunctive fragment of SPARQL. For this choice we
will discuss possible issues and challenges.</p>
      <p>
        OWL 2 QL and conjunctive queries. Even in the simplified scenario where the ontology
language is reduced to the OWL 2 QL profile [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], and only conjunctive queries are
formulated, there are still several issues regarding to the representation and navigation
of the information shown to the user:
1. Top-down propagation of property restrictions. Traditional graph representations
usually only include explicit information attached to a concept in the ontology;
however, inherited restrictions will also play an important role in graph navigation.
For example if the ontology includes the axiom Wellbore v 9hasPath:Path,7 then
the subconcepts of Wellbore should also suggest a link to the concept Path.
However, this can make the representation unfeasible when Wellbore has many
subconcepts; thus a trade-off between readability and the amount of necessary information
provided to the user should be achieved.
2. Bottom-up propagation of property restrictions. Since from a model-theoretic point
of view the interpretation of an OWL concept also includes the interpretations of all
      </p>
      <sec id="sec-2-1">
        <title>7 The axiom says that every wellbore has (at least) one path.</title>
        <p>its subconcepts, it may also make sense to suggest for a given concept the
(potential) restrictions of its subconcepts. For example, consider an ontology including
GasWell and OilWell as (direct or indirect) subconcepts of Well and the axioms
OilWell v 9hasProduction:Oil and GasWell v 9hasProduction:Gas, then the
concept Well could potentially be related to the concepts Oil and Gas.
3. Cycles in the ontology graph. Ontology axioms such as inclusion between concepts
or inverse roles can lead to cycles in the ontology graph. Thus, the navigation should
take into account these cycles and, in some cases, avoid repetitive suggestions. For
example, if one constructs a query by navigating through the following ontology
and starts the navigation from the concept Wellbore, then one gets back to Wellbore
in two steps, via the concepts Core and StratigraphicLayer.</p>
        <sec id="sec-2-1-1">
          <title>Wellbore v 9hasCore.Core</title>
        </sec>
        <sec id="sec-2-1-2">
          <title>Core v 9hasLayer.StratigraphicLayer</title>
        </sec>
        <sec id="sec-2-1-3">
          <title>StratigraphicLayer v 9layerOf.Wellbore:</title>
          <p>Should the system suggest or allow the user to go to Wellbore via the layerOf
relation when StratigraphicLayer is reached? The answer depends on the query that
the user has in mind. For example, if the user has the following query in mind,8
then Wellbore should be recommended.</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Q(x) :- Wellbore(x), hasCore(x,y), hasLayer(y,“Neolithic”),</title>
        <p>layerOf(“Neolithic”,u), Wellbore(u).</p>
        <p>Since the way to cope with cycles depends on the user’s intention, we do not
envision generic solutions to this problem. At the same time, it is useful to notify users
when they are confronted by cycles and to provide them with some form of control,
e.g., by restricting the depth of constructed queries or by allowing recursion.
4. Negative information. Negative information such as disjointness between concepts
should be exploited accordingly. For example, if the end-user selects the wells with
oil as a production type and the concepts OilWell and GasWell are disjoint in the
ontology, then the navigation system could safely skip suggestions related to GasWell.
5. Role inclusion axioms will also lead to extra complexity when navigating over
the ontology graph. For example, consider the axioms BottomHoleAssembly v
9hasBit:DrillBit and hasBit v hasPart, then the concept DrillBit should also be
suggested as a part of BottomHoleAssembly.</p>
        <p>
          In Optique we intend to design and implement novel techniques that take into
account the issues above. We aim at providing an intuitive end-user interface while
preserving the semantics of the underlying ontology in order to formulate both complex
and valid queries. In particular, we intend to look at existing work, where query
formulation is driven from a Description Logic model of the domain, e.g., [
          <xref ref-type="bibr" rid="ref1 ref4">1, 4</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>8 This query is written in the Datalog notation</title>
        <p>2.1</p>
        <p>
          Query-driven ontology extensions
The ontology may not include all the vocabulary expected or needed by the end-user.
Moreover, the vocabulary is to a certain extent specific to individuals, projects,
departments, etc. and subject to change. Thus, keeping the ontology up-to-date with respect
to the end-user needs arises as an indirect (but crucial) challenge in query
formulation. In Optique we differentiate the following changing scenarios driven by end-user
information requirements:
1. Adding new synonyms. Concept synonyms (e.g. annotation labels) do not represent
new logical extension of the ontology, and hence end-users will be able to add
them to the ontology with no (logical) harm. For example, the concept WellBore
can be extended with the labels “drill hole” or “borehole”. In order to avoid an
overloading of the ontology with synonyms, we advocate a separation between the
ontology (e.g. logical axioms) and the terminological information (e.g. synonyms,
descriptions, related terms, etc.) as proposed in [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
2. Adding basic extensions. End-user queries may also require basic extension of
the ontology hierarchy, such as adding a new concept GeologicalWellBore
under WellBore (i.e. GeologicalWellBore v WellBore). These types of additions
can be considered safe since they represent a conservative extension of the
ontology [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. However other additions to the ontology may require further analysis by
the IT-expert if they are not conservative extensions (e.g. reclassifying the concept
WellBore under the new concept PlannedSideTrack).
3. “On the fly” extensions. This represents the more challenging scenario where we
intend to exploit ontology learning techniques in order to mine formulated queries
and to identify relevant new concepts and relations (e.g., [
          <xref ref-type="bibr" rid="ref16 ref24">24, 16</xref>
          ]). Ontology
alignment techniques (e.g. [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]) will also be required in order to relate the new
vocabulary to the existing ontology concepts.
4. IT-expert assistance. In the cases where the manual or on-the-fly extensions are
insufficient, the assistance of the IT expert will be required to extend the ontology
accordingly.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Envisaged Architecture and Approach</title>
      <p>
        1. Editing components. Different users may cooperate on the same query or set of
queries, thus, the Optique solution aims at providing (at least) three kind of
interfaces to formulate the query (i.e. components): (i) direct editing, (ii) context
sensitive editing, and (iii) query by navigation exploiting faceted search and other
navigation paradigms. Technically versed users may prefer the direct editing of the
query using a formal language (e.g. SPARQL, stream query language), while other
end-user should be provided with a less technical interface such as query by
navigation. Additionally, direct editing should also allow the possibility of exploiting
the ontology, and provide context sensitive completion. All three interfaces should
provide views on the partially constructed query, and users should be able to switch
between views at will.
2. Query-driven ontology extension component will manage the ontology extensions
driven by the query requirements and will send the new ontology versions to the
Ontology Revision Control component for further analysis and validation of the
performed changes.
3. The Ontology Processing component. The ontology will be a key element for the
query formulation component and thus, the ontology processing component (e.g.
OWL API, OWL reasoners) will also play an important role. Furthermore,
logicbased ontology modularization techniques [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] will also be exploited to achieve a
good balance between overview and focus when dealing with large ontologies. The
properties of such modules guarantee that the semantics of the concepts of interest
are preserved while providing (in general) a much smaller fragment of the ontology.
4. The The Query Answering component will transform the formulated queries into
executable and optimized queries with respect to the data sources (e.g. streaming
data, relational databases).
5. The Answer Manager component. This component should deal with the (basic)
visualization of the query results and their transformation (i.e. export functionality)
into the required output formats (e.g. input formats of external Statoil tools).
6. The User Feedback component. This component is intended to allow the user to
semi-automatically refine a query if the (partially) obtained results are not the
expected ones. Furthermore, similar or related queries to the partially constructed
query will also be suggested in order to help end-users in the refinement.
7. The Ontology Revision Control component. Different versions of the ontology may
exist concurrently (e.g. extensions driven by different formulated queries or query
requirements). These versions will be managed by the IT-experts through a revision
control system in order to detect logical defects (e.g. unsatisfiabilities), logical
conflicts among versions as in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], and OWL 2 profile violations (e.g. a new version
is outside the OWL 2 QL profile).
      </p>
      <p>
        All components will be integrated into the Information Workbench [
        <xref ref-type="bibr" rid="ref8 ref9">9, 8</xref>
        ], a generic
platform for semantic data management, which provides a central triple store for managing
the OBDA system assets (such as ontologies, mappings, etc.), generic interfaces and
APIs for semantic data management, and a flexible user interface that will be used for
implementing the query formulation components. The user interface follows a semantic
wiki approach, based on a rich, extensible pool of widgets for visualization, interaction,
mashup, and collaboration, which can be flexibly integrated into semantic wiki pages,
allowing developers to compose comprehensive, actionable user interfaces without any
programming effort. The following subsection presents the technical architecture for the
query formulation interface and the solution approach based on widget-based mashups.
3.1
      </p>
      <p>
        Widget-based solution
A mashup based approach (cf. [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]) is promising for the construction of an extensible
and flexible query formulation interface. The mashup idea, in our context, is grounded
on the possibility to combine the functionality and data of a set of individual
applications in a common graphical space, for common tasks. Widgets are the building blocks
of mashups, where each widget corresponds to a standalone application with less
complex functionality and presentation compared to full-fledged applications. In query
formulation scenario, a set of widgets can be employed, for instance, one for query by
navigation and one for faceted search for handling the construction of queries; and one
for representing results in table and one for visualizing the result in a graph to handle
communication of results to the end-users.
      </p>
      <p>Widgets are managed by a widget environment which provides basic
communication and persistence services to widgets. The orchestration of widgets relies on the
requirement that each widget discloses its functionality to the environment through a
client side interface and notifies any other widget in the environment (e.g., broadcast,
subscription etc.) and/or the widget environment upon each user action. Then, either
each widget decides on what action to execute in response, by considering the syntactic
or semantic signature of the received event; or, the environment decides which widgets
to invoke with which functionality. The core benefits of such an approach are that,
i it becomes easier to deal with the complexity, since the management of functionality
and data can be delegated to different widgets;
ii each widget can employ a different visualization paradigm that best suits the
functionality that it is expected to provide;
iii widgets can be used alone or together, in different combinations, for different
contexts and experiences; and,
iv the functionality of the overall interface can be extended by introducing new
widgets (e.g., such as for result visualization).</p>
      <p>A possible architecture for a query formulation interface based on widget-based
mashups is depicted in Figure 3. The architecture assumes that each widget has client
side and server side components (for complex processing), and that widgets can
communicate with each other and with the environment through a communication channel.
Communication usually happens through the client side, but a server side
communication mechanism can also be realized in order to support remote experiences (e.g., while
widgets running on remote devices). The architecture assumes that there exists an
environment controller at the client side and a component control logic at the server side.
The former is responsible for operational tasks such as collecting the event notifications
from widgets and submitting control commands to them. The latter is responsible for
the orchestration logic, that is it decides how widgets should react to specific events.</p>
      <p>JOIN  </p>
      <p> 
Menu-­‐based  and  Icon-­‐based  Widget  
(QbN)  </p>
      <p>SELECT  and  PROJECT  </p>
      <p> 
Form-­‐based  and  Menu-­‐based  Widget  </p>
      <p>(Faceted  Search)  
Widget  2  
Widget  4  </p>
      <p> 
JOIN  </p>
      <p> 
Diagram-­‐based  Widget  
(QbN)  
 
 
 
JOIN  and  VIEW  </p>
      <p> 
Form-­‐based  (table  result)  Widget  </p>
      <p>
        (QbN)  
Catarci et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] categorize data access efforts into understanding the reality of
interest (i.e., exploration), which relates to activities for finding and understanding schema
concepts and relationships relevant to information need; and query construction, which
concerns the compilation of relevant concepts and constraints into formal information
needs. The query construction task is normally considered as a series of actions, each
of which can be either a select, join, or project action. The join type of actions enables
users to combine different concepts and to form path expressions for queries, where
the select and project type of actions allow users to specify the properties that are to
be returned and to impose constraints to filter the results. As such, the choice of visual
representation and interaction paradigm, along with underlying metaphors, analogies
etc., is of primary importance for the query formulation interface.
      </p>
      <p>
        We have observed that a single representation and interaction paradigm is not
sufficient for developing a successful query formulation interface. Therefore, we strive to
combine the best parts of different paradigms (cf. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]). A conceptual sketch of our first
attempt is shown in Figure 4. Initially, there are four widgets available. The first
widget is based on a menu-based approach with QbN interaction paradigm, where domain
concepts, properties, and relationships are distributed into a set of layers, with respect
to a certain hierarchy or organization, and presented in the form of lists. This
widget also employs an icon-based paradigm by supplementing domain vocabulary with
meaningful icons. The second widget follows a diagram-based approach with QbN.
The diagram-based approach utilizes geometric symbols to depict relationships among
schema concepts. The third widget employs a form-based and menu-based approach in
the form of a faceted search interface. The form-based approach adopts conventional
paper forms as a metaphor. The final widget is also form-based, more specifically
tablebased, and employs a QbN based interaction style.
      </p>
      <p>The first widget is responsible for join actions, and determines the focus of
interface. First, available domain concepts are shown to the user; as soon as a user selects a
domain concept, the selected concept becomes the focus, and relationships pertaining to
this concept are listed. The second widget is responsible for providing an overview by
allowing the user to switch between a graph visualization of the query and the ontology.
The third widget presents the properties of the focus concept in the form of fields and
menu-items to enable the user to select properties of interest and to specify constraints
on them. The fourth widget represents query results in a common table view and
enables user to navigate at instance level by accessing other facts that are linked to the
result items in the table view.</p>
      <p>
        The proposed approach provides a good balance between view and overview and
supports domain exploration and query construction efforts. It also provides an ample
amount of room for supportive features, since it is typically not possible to address every
requirement with visual representations [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]. This particularly becomes true for large
ontologies, in which guiding the user to relevant vocabulary is of crucial importance.
For instance, a keyword search facility can support finding relevant concepts, properties
and relationships in the first and second widgets. Each representation paradigm can
handle different ontology axioms, for instance, a faceted search paradigm is better suited
for representing disjointness, and a menu-based paradigm with QbN may be a better
option for handling cycles (e.g., with path coloring).
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>We have presented the main challenges to be faced in the design and development of
the query formulation and query-driven ontology extension solutions. Although the EU
project Optique is still in an early stage, we aim at turning our preliminary ideas into
novel solutions in the very near future, and to evaluating their effectiveness in our
industry use cases. This will provide us with invaluable feedback to inform ongoing research
and development of enhanced query formulation components.</p>
      <p>Acknowledgements. The research presented in this paper was financed by the
Seventh Framework Program (FP7) of the European Commission under Grant Agreement
318338, the Optique project. Cuenca Grau, Horrocks, Jime´nez-Ruiz, Kharlamov, and
Zheleznyakov were also partially supported by the EPSRC projects ExODA and Score!</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bechhofer</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Driving User Interfaces from FaCT</article-title>
          .
          <source>In: Proceedings of the 2000 International Workshop on Description Logics</source>
          . pp.
          <fpage>45</fpage>
          -
          <lpage>54</lpage>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giacomo</surname>
            ,
            <given-names>G.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lembo</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poggi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rodriguez-Muro</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rosati</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ruzzi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Savo</surname>
            ,
            <given-names>D.F.</given-names>
          </string-name>
          :
          <article-title>The MASTRO system for ontology-based data access</article-title>
          .
          <source>Semantic Web</source>
          <volume>2</volume>
          (
          <issue>1</issue>
          ),
          <fpage>43</fpage>
          -
          <lpage>53</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Catarci</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Costabile</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levialdi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Batini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Visual query systems for databases: A survey</article-title>
          .
          <source>Journal of Visual Languages and Computing</source>
          <volume>8</volume>
          (
          <issue>2</issue>
          ),
          <fpage>215</fpage>
          -
          <lpage>260</lpage>
          (APR
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Catarci</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dongilli</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mascio</surname>
          </string-name>
          , T.D.,
          <string-name>
            <surname>Franconi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Santucci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tessaris</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>An ontology based visual tool for query formulation support</article-title>
          .
          <source>In: ECAI</source>
          . pp.
          <fpage>308</fpage>
          -
          <lpage>312</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Crompton</surname>
          </string-name>
          , J.: Keynote talk at the W3C Workshop on Semantic Web in Oil &amp; Gas Industry: Houston, TX, USA,
          <fpage>9</fpage>
          -10
          <string-name>
            <surname>December</surname>
          </string-name>
          (
          <year>2008</year>
          ), available from http://www.w3.org/
          <year>2008</year>
          /12/ogws-slides/Crompton.pdf
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Cuenca</given-names>
            <surname>Grau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            ,
            <surname>Horrocks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            ,
            <surname>Kazakov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Sattler</surname>
          </string-name>
          ,
          <string-name>
            <surname>U.</surname>
          </string-name>
          :
          <article-title>Modular reuse of ontologies: Theory and practice</article-title>
          .
          <source>J. Artif. Intell. Res</source>
          .
          <volume>31</volume>
          ,
          <fpage>273</fpage>
          -
          <lpage>318</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Giese</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ioannidis</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kllapi</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koubarakis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lenzerini</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Mo¨ller, R., O¨ zc¸ep,
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Rodriguez</surname>
          </string-name>
          <string-name>
            <surname>Muro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Rosati</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Schlatte</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Soylu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Waaler</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Scalable End-user Access to Big Data</article-title>
          . In: Rajendra Akerkar:
          <article-title>Big Data Computing</article-title>
          . Florida : Chapman and Hall/CRC. To appear. (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Hu¨tter,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Schmidt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Schwarte</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>The Information Workbench as a SelfService Platform for Linked Data Applications</article-title>
          .
          <source>In: the WWW 2012 Developer Track</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schmidt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwarte</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The Information Workbench as a Self-Service Platform for Linked Data Applications</article-title>
          .
          <source>In: Proceedings of the Second International Workshop on Consuming Linked Data (COLD)</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Heim</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ziegler</surname>
          </string-name>
          , J.:
          <article-title>Faceted visual exploration of semantic data</article-title>
          .
          <source>In: Second IFIP WG 13</source>
          .
          <article-title>7 conference on Human-computer interaction and visualization</article-title>
          . pp.
          <fpage>58</fpage>
          -
          <lpage>75</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Jime</surname>
          </string-name>
          <article-title>´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>LogMap: Logic-based and Scalable Ontology Matching</article-title>
          . In:
          <string-name>
            <surname>Int'l Sem</surname>
          </string-name>
          .
          <source>Web Conf. (ISWC)</source>
          . pp.
          <fpage>273</fpage>
          -
          <lpage>288</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Jime</surname>
          </string-name>
          <article-title>´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sattler</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berlanga</surname>
          </string-name>
          , R.:
          <article-title>Safe and economic re-use of ontologies: A logic-based methodology and tool support</article-title>
          .
          <source>In: The 5th European Semantic Web Conference, ESWC</source>
          . vol.
          <volume>5021</volume>
          , pp.
          <fpage>185</fpage>
          -
          <lpage>199</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Jime</surname>
          </string-name>
          <article-title>´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grau</surname>
            ,
            <given-names>B.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Llavori</surname>
          </string-name>
          , R.B.:
          <article-title>Supporting concurrent ontology development: Framework, algorithms and tool</article-title>
          . Data Knowl.
          <source>Eng</source>
          .
          <volume>70</volume>
          (
          <issue>1</issue>
          ),
          <fpage>146</fpage>
          -
          <lpage>164</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Jimeno-Yepes</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <article-title>Jime´nez-</article-title>
          <string-name>
            <surname>Ruiz</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Llavori</surname>
            ,
            <given-names>R.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rebholz-Schuhmann</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Reuse of terminological resources for efficient ontological engineering in life sciences</article-title>
          .
          <source>BMC Bioinformatics 10(S-10)</source>
          ,
          <volume>4</volume>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Katifori</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Halatsis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lepouras</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vassilakis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giannopoulou</surname>
          </string-name>
          , E.:
          <article-title>Ontology visualization methods - A survey</article-title>
          .
          <source>ACM Computing Surveys</source>
          <volume>39</volume>
          (
          <issue>4</issue>
          ) (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Kotis</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Papasalouros</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maragoudakis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Mining query-logs towards learning useful kick-off ontologies: an incentive to semantic web content creation</article-title>
          .
          <source>IJKEDM</source>
          <volume>1</volume>
          (
          <issue>4</issue>
          ) (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>S.C.J.</given-names>
          </string-name>
          , Liu,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.B.</surname>
          </string-name>
          :
          <article-title>Faceted search and retrieval based on semantically annotated product family ontology</article-title>
          .
          <source>In: Proc. of teh Workshop on Exploiting Semantic Annotations in Information Retrieval</source>
          . pp.
          <fpage>15</fpage>
          -
          <lpage>24</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Lohse</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Biolsi</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Walkner</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rueter</surname>
          </string-name>
          , H.:
          <article-title>A classification of visual representations</article-title>
          .
          <source>Communications of the ACM</source>
          <volume>37</volume>
          (
          <issue>12</issue>
          ),
          <fpage>36</fpage>
          -
          <lpage>49</lpage>
          (DEC
          <year>1994</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Motik</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cuenca Grau</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horrocks</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fokoue</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lutz</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          : OWL 2
          <string-name>
            <given-names>Web</given-names>
            <surname>Ontology Language: Profiles</surname>
          </string-name>
          (
          <year>2009</year>
          ), W3C Recommendation
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Rodriguez-Muro</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Calvanese</surname>
            ,
            <given-names>D.:</given-names>
          </string-name>
          <article-title>High Performance Query Answering over DL-Lite Ontologies</article-title>
          .
          <source>In: the 13th Int'l Knowledge Representation and Reasoning Conf. (KR)</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Soylu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Modritscher</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Causmaecker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Ubiquitous web navigation through harvesting embedded semantic data: A mobile scenario</article-title>
          .
          <source>Integrated Computer-Aided Engineering</source>
          <volume>19</volume>
          (
          <issue>1</issue>
          ),
          <fpage>93</fpage>
          -
          <lpage>109</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Soylu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Modritscher</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wild</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Causmaecker</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Desmet</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Mashups by orchestration and widget-based personal environments Key challenges, solution strategies, and an application</article-title>
          .
          <source>Program-Electronic Library and Information Systems</source>
          <volume>46</volume>
          (
          <issue>4</issue>
          ),
          <fpage>383</fpage>
          -
          <lpage>428</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Suominen</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Viljanen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , Hyva¨nen, E.:
          <article-title>User-Centric Faceted Search for Semantic Portals</article-title>
          .
          <source>In: Proc. of the 4th European Semantic Web Conf. (ESWC</source>
          <year>2007</year>
          ). pp.
          <fpage>356</fpage>
          -
          <lpage>370</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Xiong</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Mining query log to assist ontology learning from relational database</article-title>
          .
          <source>In: Frontiers of WWW Research and Development (APWeb)</source>
          . pp.
          <fpage>437</fpage>
          -
          <lpage>448</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>