<!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>
      <journal-title-group>
        <journal-title>Feb</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Konduit VQB: a Visual Query Builder for SPARQL on the Social Semantic Desktop</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Knud M o¨ller knud.moeller@deri.org</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Author Keywords Visual Query Builder, SPARQL</institution>
          ,
          <addr-line>Nepomuk</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Digital Enterprise Research Institute (DERI) National University of Ireland</institution>
          ,
          <addr-line>Galway, NUIG</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Oszk a ́r Ambrus</institution>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Siegfried Handschuh</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2010</year>
      </pub-date>
      <volume>7</volume>
      <issue>2010</issue>
      <abstract>
        <p>With the adoption of Nepomuk as an organic part of KDE the semantic desktop became a reality to a great number of users and is employed by a growing number of applications. Thus, the amount of semantic data is constantly growing on the desktop. Therefore users need a way to access this data outside of the limiting use cases of the applications employing Nepomuk-KDE. We aim to assist users in building queries and running them to make use of RDF data that would otherwise be partially or completely hidden. In this paper, as an initial iteration of our efforts, we present four approaches to building SPARQL queries visually, based on two different categorizations: schema-based vs. instance-based and SELECT vs. CONSTRUCT queries. We present the used interfaces, visual languages and query generation methods associated to each of approaches as well as the autocompletion techniques for the instancebased query builders.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        INTRODUCTION
The Social Semantic Desktop [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] is a paradigm
transposing Semantic Web concepts unto the desktop. Ontologies
thus conceptualize information and semantic data is stored
in RDF. It loosens the borders between applications and
provides a unified environment. The Nepomuk project [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]
outlines the requirements and functionalities of the Social
Semantic Desktop and defines an architecture specification that
fulfills these requirements. Nepomuk-KDE1 is a reference
implementation of Nepomuk. It provides a platform to
create and handle all kinds of metadata. It uses RDF stores for
the metadata persistence and provides a middleware for
applications to build upon, allowing them to store and access
the semantic data on the desktop (or, alternatively, the Web).
      </p>
      <p>
        Konduit [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] is a tool for building visual workflows for RDF
data within Nepomuk-KDE, allowing for a flexible access to
the local RDF data as well as mashing up with web-based
data. It features a visual programming environment and
allows for various manipulations (merging, filtering, mashing
up, creating visual workflows, etc.) as well as executing
different actions (executing scripts, automatizing emails, etc.)
using the queried RDF data. A query builder is used to
generate SPARQL queries for querying components which act
as data sources in the RDF workflows, producing data that is
made use of further in the workflow.
      </p>
      <p>
        We want to provide a way for users to build these queries
in an intuitive way, with having no or little knowledge about
the querying language (i.e., SPARQL [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). Although this
does not mean a complete abstraction from the underlying
details, we aim to assist users with limited technical
knowledge as well as those who know SPARQL and RDF (with
an emphasis on the latter, though) and provide an interface
that suits the needs of both. We try to provide a tool with
the necessary features similar tools provide, that also
supports RDF, provides search assistance on a whole repository
(as opposed to a single ontology) and is also integrated into
Nepomuk-KDE (within Konduit and beyond) allowing for
local data-driven querying as well as sharing queries online.
We explore several approaches due to the structured nature
of RDF data and the difficulty of searching and querying
it in an intuitive and transparent manner. We present, as a
first attempt in our research on visual query builders, four
interfaces aiming to achieve the above goal, with different
approaches to query building and varying degrees of
complexity. The first two of them are schema-based, allowing
for building queries using restrictions based on the ontology
structure. The second two use a triple construction-based
approach; the user constructs the restricting triples of the
SPARQL query assisted by suggestions using both schema
and instance information from the underlying repository.
RELATED WORK
There are a number of tools that aim to assist users in
building queries for semantic data. Many of them provide novel
and intuitive approaches and demonstrate useful features,
such as NITELIGHT [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] or RDF-GL [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] aiming to
represent SPARQL constructs through graphical metaphors.
MashQL [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], GRQL [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and GLOO [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] propose queries as trees
starting from a given class and restricting it incrementally
on the branches. SPARQLViz [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] provides a click-through
wizard for composing queries and SEWASIE [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] features a
limited ontology-based query formulation.
      </p>
      <p>Nevertheless, several of the tools only support querying based
on a single ontology, some of them do not support RDF and
SPARQL. Some of them require extensive manual editing
of the queries, or do not feature clear relationships between
query parts. Moreover, excepting SPARQLViz, all query
builders are web-based (or only usable within their own
system), not allowing for the integration of desktop data.
Our two schema-based interfaces are mostly built on the
intuition of MashQL and GRQL, in exposing schema
structures and possible restrictions branching from an initial class.
The instance-based query builders resemble SPARQLViz in
providing forms for the user to complete, but feature a single,
less confusing and simple interface, with clear connections
between the query parts.</p>
      <p>RUNNING EXAMPLE
Suppose we are searching for a contact from the local
repository whose name contains the letter ‘K’ and has written a
publication on the semantic desktop.</p>
      <p>QUERY BUILDING
The interface of the query builder application features a
central part for the visual query builder and previewers for the
query and its results, as well as menu actions and a status bar.
The central query builder has four incarnations as presented
in the following sections, employing different approaches to
building SPARQL queries.</p>
      <p>The most common searching interface, a search box for
simple keyword searches to retrieve semantic information is
highly ambiguous and needs extensive research, so abstracting
completely from the structure of semantic data is not yet our
intention. Also, we can’t yet provide a fully-featured
mature semantic querying application, as we aim to explore the
most appropriate ways to do it and research the possibilities
and limitations in accomplishing this task.</p>
      <p>The two schema-based approaches use schema information
from the ontologies in the Nepomuk system, allowing users
to compose tree-based queries in restricting the properties of
the resulting objects. This allows users to explore the local
schema structures. These approaches feature a simplification
of SPARQL, in allowing only to restrict the initial selection
descending in a tree-like fashion.</p>
      <p>The instance-based approaches are based on constructing
triples without necessarily knowing RDF or SPARQL
(similarly to the Wikipedia Visual Query Builder2. They use
schema information as well as instance information in
suggesting users possibilities in completing the subjects,
predicates and objects of the constraining triples of the SPARQL
query. This autocompletion allows for users to explore the
data stored on the local RDF repository. The instance-based
query builders also allow for the construction of triples that
2http://dl-learner.org/Projects/dbpedia
don’t exist in the repository, adding properties that have not
been defined or converting an instance from one ontology to
another, e.g., transforming ?v foaf:name ‘‘Smith’’
to ?v nco:fullName ‘‘Smith’’.</p>
      <p>SCHEMA-BASED SELECT QUERIES
The schema-based SELECT query builder (Figure 1) is the
most user-friendly approach to building SPARQL queries,
aimed at users having the least knowledge of semantic
technologies. We have devised a simplification of the SPARQL
language, which allows for this particular kind of builder.
It allows for selecting a class (which will be the type of
the queried variable) and restricting it in a tree-like manner
through its properties.</p>
      <p>Queries are built using schema information from Nepomuk.
The possible classes and predicates to be chosen are queried
and presented to the user.</p>
      <p>We start from the assumption that users most often want
to find certain information belonging to an entity of certain
classification and/or having a number of known restricting
characteristics. For example, one would want to search for a
contact person (entity) with a given name (restricting
characteristic), similarly to doing a free text search.</p>
      <p>The interface therefore provides a way to build queries as
trees, starting with the type of entity the user inquires for
and progressing with restrictions on the branches of the tree.
The Visual Language
The visual language covers a subset of SPARQL. Listing 1
provides a formal description of the queries built through the
visual facilities of the interface. Note that the missing
terminal definitions ClassN ame and P redicate are IRI
references, LiteralV alue is a string literal and V ariableN ame
is a SPARQL variable (such as ?v or $x). Relation denotes
a relation such as contains, equals, etc.</p>
      <p>Query : : = O u t p u t s C o n d i t i o n s
O u t p u t s : : = RootNode j L i t e r a l N o d e
C o n d i t i o n s : : = G r a p h P a t t e r n
G r a p h P a t t e r n : : = QueryTree +
QueryTree : : = RootNode TreeNumber
RootNode : : = ClassName VariableName R e s t r i c t i o n s
R e s t r i c t i o n s : : = QueryNode
QueryNode : : = C l a s s R e s t r i c t i o n j L i t e r a l R e s t r i c t i o n
C l a s s R e s t r i c t i o n : : = P r e d i c a t e RootNode
L i t e r a l R e s t r i c t i o n : : = P r e d i c a t e R e l a t i o n L i t e r a l N o d e
L i t e r a l N o d e : : = VariableName L i t e r a l V a l u e</p>
      <p>Listing 1. EBNF description of the visual language (non-terminals)
Query Generation
Queries are generated based on the visual description
according to the defined language. The SELECT part of the
queries will be a set of variables extracted from the
components (class combo boxes or literal text boxes) selected
as Outputs. It is made up of the variable names in the
RootN odes and LiteralN odes, for class combo boxes or
literal text boxes, respectively. This happens in a
transparent way, as variables are extracted automatically from the
selected components.</p>
      <p>The WHERE clause is a set of RDF triples generated from
the query tree structures present in the query form. We have
the following three cases: (1) For the root RootN ode the
generated triple is VariableName a ClassName and
for every restriction a triple is generated starting with
VariableName and continuing as presented in the following
points (e.g. ?v41 a foaf:Person generated for the root
node in Figure 1). (2) A ClassRestriction completes the
parent’s triple with Predicate VariableName (where
VariableName is the variable of the RootN ode
belonging to the new restriction) (e.g. ?v41 foaf:
publications ?v77 generated for the publication
restriction in Figure 1). (3) A LiteralN ode completes the
triple with Predicate VariableName adding a
regular expression filter string according to the chosen Relation
and LiteralV alue (e.g. FILTER regex(?v59, ’K’,
’i’) generated for the first restriction shown in Figure 1).
User Interface
The query builder form (Figure 1) allows for adding several
query trees (staring from different classes), and restricting
them by their properties. If a property has a literal range, the
user can enter a value and restrict it on a relation, such as
equals or contains. If its range is not a literal, they can
add restrictions.</p>
      <p>Outputs are selected by right clicking on a combo box
representing a class or a value. The corresponding variable will be
added to the output, and the combo box will be highlighted.
SCHEMA-BASED CONSTRUCT QUERIES
The approach to building schema-based CONSTRUCT
queries is very similar to the one shown in the previous section.
The difference lies in the way in which the outputs are
selected.</p>
      <p>Visual Language Extension
The visual language is extended, as the output part of the
queries is built using graph patterns constructed from triples.
O u t p u t s : : = G r a p h P a t t e r n
G r a p h P a t t e r n : : = T r i p l e +
T r i p l e : : = S u b j e c t P r e d i c a t e O b j e c t
S u b j e c t : : = VariableName
P r e d i c a t e : : = PredicateName j VariableName j ClassName
O b j e c t : : = PredicateName j VariableName j ClassName
j L i t e r a l V a l u e</p>
      <p>Listing 2. EBNF description of the output part (non-terminals)
Query Generation Extension
The way outputs are generated has been changed for this
query builder: in this case outputs are triples and consist of
the triples described in the graph pattern.</p>
      <p>User Interface Extension
The user interface is extended with a component for
composing output triples, as shown in Figure 2. It lists all variables
for the subject field, all variables, predicates and classes for
the predicate field and all variables, predicates, classes and
literal values for the object field. Users can select desired
triples and add them to the output list.</p>
      <p>INSTANCE-BASED SELECT QUERIES
Building queries with the instance-based SELECT builder
relies on schema and instance information from the
underlying RDF repository.</p>
      <p>
        The Visual Language
Variable, class and predicate names are IRIs describing the
corresponding entities, as described for the previous builders,
where the meaning of Relation is also explained. Instance
IRIs are taken from the repository as autocompletion
popups based on user input. The LiteralV alue represents valid
SPARQL literals, such as strings or integers (e.g.
"Example" ). See Listing 3 for the formal EBNF description.
Listing 3. Visual language of the instance-based SELECT query
builder
Query Generation
Queries are constructed by enumerating the variable names
for the SELECT part and taking the list of triples for the
WHERE part. Filter expressions are built by adding a
regular expression filter string according to the chosen relation.
Autocompletion
The interface features an incremental autocompletion for the
WHERE part based on user input described in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], because
of the infeasibility of listing all the instances. Whenever the
user types something into any of the text boxes, the
system pops up all the possible options of RDF entity names,
classes, properties or instance identifiers and values. This
helps the user in exploring the underlying data set.
Autocompletion is achieved by running an incremental query
every time the user enters text. The system queries for all
entity names (classes, predicates) as well as all instance
identifiers or values that contain the user input and match the
graph pattern constructed so far (for the final query to have
results). The user is then presented with the list of possible
options, this list incrementally growing as more matches are
found from the RDF repository.
      </p>
      <p>User Interface
The user interface features a component for building
conditional (WHERE) triples, as shown in Figure 3. The text
fields provide autocompletion popups for user input, based
on what the repository contains, against the triples that have
already been added to the output list. The user can select a
filter option using the desired relation or can specify the type
of the object, the latter defining the way it will be formatted
and/or suffixed in the output.</p>
      <p>Outputs are selected from an output list that is populated
with all the variables occurring in the conditional triples.
INSTANCE-BASED CONSTRUCT QUERIES
Visual Language Extension
The visual language is extended with triple patterns for the
output part as well. They are identical to the GraphP attern
nonterminal defined for instance-based SELECT queries.
There is one exception, namely the lack of F
ilterExpressions, since such expressions do not exist in the output part
of SPARQL queries for obvious reasons.
Query Generation Extension
The query generation is extended by taking the triples from
the Output graph pattern and enclosing them in the
CONSTRUCT part of the query.</p>
      <p>Autocompletion Extension
This interface also supports autocompletion for the output
part of the query, similarly to its sibling interface. There is a
slight modification, however, since the output triplesv´alues
do not need to satisfy any conditions, only being present in
forming the output triples. Thus, it is not required to comply
with the rest of the graph pattern, so all existing entities are
suggested to the user, that match the given input.</p>
      <p>User Interface Extension
The user interface is extended with an output construction
part, shown in Fig. 4, having an almost identical structure to
the triple building component for the conditional (WHERE)
part, excluding the filtering option.</p>
      <p>DISCUSSION
The schema-based SELECT query builder allows for
simple querying and restricting the desired properties with
userdefined input. The advantage is that it is simple, intuitive
and satisfies the large number of occasions when the user
wants to search for something based on certain properties.
Selecting the outputs is also straightforward and clear. The
disadvantage is that it is limiting and inflexible, only
allowing querying as trees, thus being unsuitable for some cases a
proficient user would meet.</p>
      <p>The schema-based CONSTRUCT query builder allows to
construct triples, this being required in many cases (in
Konduit, all data are RDF triples). The advantages/disadvantages
are similar to its sibling approach, adding the complication
of selecting the correct variables and classes for the output
triples, but adding the flexibility of formatting the output.
For the instance-based SELECT query builder we have the
advantages of conditioning the results in a flexible,
datadriven manner (with autocompletion based on the data in
the repository), using user-defined variables and types, and
reusing variables. The disadvantage is that it features a direct
correspondence of the underlying RDF structure, making it
more complicated than the schema-based interfaces.
The instance-based CONSTRUCT query builder is the most
flexible, triple-based query assistant, making it possible to
compose advanced queries, with the obvious disadvantage
of being the least accessible to na¨ıve users.</p>
      <p>CONCLUSIONS
We have presented four techniques to assist users in
building SPARQL queries to retrieve information from the
evergrowing collection of semantic data. Aimed at beginners
and proficient users as well, the interfaces feature a range of
approaches that ease the composition of queries. The query
builders are based on the local (or possibly, remote)
repository, facilitating the discovery of the RDF store.</p>
      <p>The first two approaches relied solely on schema
information, helping the users to query for instances of existing classes
and restricting them with the available properties. One of
these is intended for writing SELECT queries by selecting
a set of outputs, the other one is for CONSTRUCT queries
presenting the used variables, predicates and classes in three
lists for selecting the subject, predicate and object.
The other two approaches use instance information as well
in providing autocompletion popups based on user input to
suggest possible options, taking into consideration the triples
previously added. The SELECT query builder simply
allows for selecting the variables used in the query for output,
and the CONSTRUCT query builder allows for composing
triples from the variables used and all existing entities in the
repository.</p>
      <p>We plan to perform a usability evaluation in determining the
most appropriate tool from the ones presented for building
SPARQL queries within Konduit and Nepomuk-KDE. We
will present it to users with no RDF/SPARQL background
as well as users with deep knowledge in semantic
technologies to decide on the future direction in what approach and
features best suits a SPARQL query builder aimed at a fairly
wide variety of users.</p>
      <p>Acknowledgments
The work presented in this paper has been funded (in part) by Science
Foundation Ireland under Grant No. SFI/08/CE/I1380 (L´ıon-2) and (in part) by</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>N.</given-names>
            <surname>Athanasis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Christophides</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Kotzinos</surname>
          </string-name>
          .
          <article-title>Generating on the fly queries for the semantic web: The ICS-FORTH graphical RQL interface (GRQL)</article-title>
          .
          <source>Lecture notes in computer science</source>
          , pages
          <fpage>486</fpage>
          -
          <lpage>501</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>J.</given-names>
            <surname>Borsje</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Embregts</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S. F.</given-names>
            <surname>Frasincar</surname>
          </string-name>
          .
          <article-title>Graphical query composition and natural language processing in an rdf visualization interface</article-title>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>T.</given-names>
            <surname>Catarci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Dongilli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. Di</given-names>
            <surname>Mascio</surname>
          </string-name>
          , E. Franconi, G. Santucci, and
          <string-name>
            <given-names>S.</given-names>
            <surname>Tessaris</surname>
          </string-name>
          .
          <article-title>An ontology based visual tool for query formulation support</article-title>
          .
          <source>In ECAI</source>
          , volume
          <volume>16</volume>
          , page 308,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>S.</given-names>
            <surname>Decker</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Frank</surname>
          </string-name>
          .
          <article-title>The networked semantic desktop</article-title>
          .
          <source>In WWW Workshop on Application Design, Development and Implementation Issues in the Semantic Web</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>A.</given-names>
            <surname>Fadhil</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Haarslev</surname>
          </string-name>
          .
          <article-title>Gloo: A graphical query language for owl ontologies</article-title>
          . In B. C. Grau,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hitzler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Shankey</surname>
          </string-name>
          , and E. Wallace, editors,
          <source>OWLED</source>
          , volume
          <volume>216</volume>
          <source>of CEUR Workshop Proceedings. CEUR-WS.org</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>T.</given-names>
            <surname>Groza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Handschuh</surname>
          </string-name>
          , K. Mo¨ller, G. Grimnes,
          <string-name>
            <given-names>L.</given-names>
            <surname>Sauermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Minack</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Mesnage</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jazayeri</surname>
          </string-name>
          , G. Reif, and
          <string-name>
            <given-names>R.</given-names>
            <surname>Gudjo</surname>
          </string-name>
          <article-title>´nsdo´ttir. The NEPOMUK project - on the way to the social semantic desktop</article-title>
          . In T. Pellegrini and S. Schaffert, editors,
          <source>Proceedings of I-Semantics' 07</source>
          , pages pp.
          <fpage>201</fpage>
          -
          <lpage>211</lpage>
          . JUCS,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>F.</given-names>
            <surname>Hogenboom</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Milea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Frasincar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>U.</given-names>
            <surname>Kaymak.</surname>
          </string-name>
          RDF-GL:
          <article-title>A SPARQL-Based Graphical Query Language for RDF</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>M.</given-names>
            <surname>Jarrar</surname>
          </string-name>
          and
          <string-name>
            <given-names>M. D.</given-names>
            <surname>Dikaiakos</surname>
          </string-name>
          .
          <article-title>Mashql: a query-by-diagram topping sparql</article-title>
          .
          <source>In ONISW '08: Proceeding of the 2nd international workshop on Ontologies and nformation systems for the semantic web</source>
          , pages
          <fpage>89</fpage>
          -
          <lpage>96</lpage>
          , New York, NY, USA,
          <year>2008</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>K.</given-names>
            <surname>Mo</surname>
          </string-name>
          <article-title>¨ller. Lifecycle Support for Data on the Semantic Web</article-title>
          .
          <source>PhD thesis</source>
          , National University of Ireland, Galway,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10. K. Mo¨ller, S. Handschuh,
          <string-name>
            <given-names>S.</given-names>
            <surname>Trug</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Josan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Decker</surname>
          </string-name>
          . Demo:
          <article-title>Visual programming for the semantic desktop with Konduit</article-title>
          .
          <source>In 5th European Semantic Web Conference (ESWC2008)</source>
          , Tenerife, Spain, volume
          <volume>5021</volume>
          <source>of LNCS</source>
          , pages
          <fpage>849</fpage>
          -
          <lpage>553</lpage>
          . Springer,
          <year>June 2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11. E.
          <string-name>
            <surname>Prud</surname>
          </string-name>
          <article-title>'hommeaux and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Seaborne</surname>
          </string-name>
          .
          <article-title>SPARQL query language for RDF</article-title>
          . Recommendation, W3C,
          <year>January 2008</year>
          . http: //www.w3.org/TR/rdf-sparql-query/.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>P. R.</given-names>
            <surname>Smart</surname>
          </string-name>
          and
          <string-name>
            <surname>Russell.</surname>
          </string-name>
          <article-title>A visual approach to semantic query design using a web-based graphical query designer</article-title>
          .
          <source>In EKAW '08: Proceedings of the 16th international conference on Knowledge Engineering</source>
          , pages
          <fpage>275</fpage>
          -
          <lpage>291</lpage>
          , Berlin, Heidelberg,
          <year>2008</year>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>