<!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 an update-enabled Mediator System using Semantic Web technology</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stefan Haun</string-name>
          <email>shaun@iti.cs.uni-magdeburg.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Sandro Schulze</string-name>
          <email>sandro.schulze@iti.cs.uni-magdeburg.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andreas Nürnberger</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Otto-von-Guericke-University Magdeburg</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>A large part of implementing information retrieval or data mining systems consists of joining data from di erent sources to connect related items, enrich data sets and nd similarities or contradictions. Mediators take care of the conversion between di erent formats and access to the data sources to provide a uni ed view, however these systems either only support read operations or are limited to a schema derived from a xed set of data sources. We sketch a concept for a mediator based on Semantic Web technology { especially RDF/OWL and SPARQL { enriched with semantics from the wrappers and an ontology describing the schema integration. Our system is able to handle updates on the uni ed view, feeding them back to the respective data sources and therefore extends the capabilities of classic data warehouses of federated databases. Furthermore we analyze how CARSA, a meta-search engine framework, can be extended to implement the concept and discuss upcoming problems and ideas for their solution.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. MOTIVATION</title>
      <p>With more and more data sources available, it gets harder
to integrate the di erent data formats and maintain and
link the provided information. Although algorithms for
processing the data are independent from their representation,
much time must be invested in the development for
wrappers and transformation functions between an actual data
representation and the one needed for a speci c algorithm,
often reimplemented for each distinct data source.
Automated converters are available but often su er from the lack
of knowledge about semantics necessary to come up with
correct conversions.</p>
      <p>We elaborate a system that allows to easily plugin data
sources and access the contained information, but still is able
to propagate back changes on the integrated data. This is
The work presented here was supported by the European
Commission under the 7th Framework Programme
FP7ICT-2007-C FET-Open, contract no. BISON-211898.
achieved by adding semantics to the data, using RDF/OWL
in combination with Ontologies and custom wrappers,
enabling a mediator to integrate arbitrary data sources. With
knowledge of the datas' meaning we want to build a
system which is able to determine how updates on the
RDFbased representation have to be applied to the original data
sources, therefore obtaining an integrated view on the data
which is no more read-only.</p>
      <p>The CARSA framework, developed at the Data and
Knowledge Engineering Group, will be used to implement the
concept. Existing solution for RDF-based mediation and query
planning shall be integrated if possible.</p>
      <p>This paper gives a short overview on related work according
data integration and Semantic Web technologies and
afterwards presents out hitherto ideas on such mediator system,
closing with an outlook on the next steps and plans on future
development.</p>
    </sec>
    <sec id="sec-2">
      <title>2. RELATED WORK</title>
      <p>Related work comes from the eld of Databases, especially
data integration, which is concerned with a uni ed view on
data from multiple, heterogeneous sources, and the eld of
Data and Knowledge Engineering, providing Semantic Web
technology which we use to represent information in our
system.</p>
    </sec>
    <sec id="sec-3">
      <title>2.1 On data integration</title>
      <p>In general, Data Sources (DS) are autonomous with respect
to design, schema, if any is de ned, data model and
management. Often they are created in advance on usually not with
integration in mind. In a data integration system, queries
are processed by translating them into (sub-)queries in a
form appropriate for the DS which is known to contain the
respective data. This is not a trivial task as di erent DS
may have di ering models and access limitations have to be
considered. Among heterogeneity in hardware and
communication protocols, logical di erences are the most intricate
problem. If the DS are limited to relational database
systems, there are no model con icts and de ned schemas are
available, thus lessening the problem. However, not all data
sources encountered do have this form.</p>
      <p>
        Distributed Database Systems (DBS) are integrated, mostly
homogeneous DBS where the distribution is known in
advance.[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] DS which are added to the DBS are known, i.e.
their schema is known and must adhere to the give global
schema. Only some characteristics meet the requirements of
the system we aim at, such as local autonomy, distributed
query processing and, to some extent, distributed
transaction handling.
      </p>
      <p>
        Federated Database Systems (FDBS) consist of
semi-autonomous components { in the role of DS { which have been
extended by an interface to communicate with each other,
where each component is a centralized or distributed DBMS
of itself. Tightly coupled FDBS have one or a uni ed schema,
which is static and therefore makes it hard to add additional
DS. Loosely coupled FDBS do not have a uni ed schema
and the components are more autonomous. With no global
schema, each source can create its own federated schema.
Logical heterogeneity has to be solved manually by experts.
This concept is suitable for a small number of (autonomous)
sources if their independence has to be retained. [
        <xref ref-type="bibr" rid="ref12 ref5">5, 12</xref>
        ]
Mediator Systems are an alternative architecture for data
integration systems where integration is achieved by providing
a global view in DS { the mediated schema for user queries.
Basic components are the mediator, which o ers a common
interface to all DS, and a wrapper per DS. The mediator
receives a query based on the uni ed schema, decomposes and
distributes it to the particular DS with regard to an optimal
query plan. The results from sub-queries are merged and
handed back to the user. All interactions with the DS are
going through the wrapper, which acts as a transformer
between the mediator system and other participated DS. The
wrapper converts the representation of the DS into a
suitable schema according to the uni ed schema of the mediator
system, which can be and most likely is di erent to the
internal representation of the DS. Source descriptions are used
to model the relationship of the global, uni ed schema and
schemas local to the respective DS. In comparison to FDBS,
data sources are not necessarily databases themselves and
can be easily added and removed. However, mediated
system usually only provide read access to the represented data,
a shortcoming which we try to remedy with our system.
In a Data Warehouse (DWH), also known as Materialized
View, data is loaded into a separate database. A-priory
knowledge is needed about what information can be
exprected from each source, the views on the respective sources
that should be materialized and the global schema employed
by the DWH. Because there is no coupling between the
DWH and its DS, explicit updates are needed to re ect
changes in the underlying data sources to the DWH,
therefore changes are not represented immediately. [
        <xref ref-type="bibr" rid="ref3 ref8">8, 3</xref>
        ]
The BISON project1 uses a DWH-like structure to represent
all incorporated DS in one single large graph representation.
As the DS, which are mostly result data from experiments,
publications and similar structures, do not change very
often, this structure is feasible. However, recent changes will
not show up until the next update process. Mediator
systems, as well as FDBS, can be considered as Virtual View
approaches, because they provide the user with a uni ed
view on all DS without exposing their distinctiveness. As
we want to re ect updates in the underlying DS
immediately, mediator systems are more suitable for our approach.
ready been combined, for example in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], presenting a
semantic web middleware for virtual data integration on the web,
and concept-based querying in mediator systems is shown in
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Both systems serve a a basis for our approach.
      </p>
    </sec>
    <sec id="sec-4">
      <title>2.2 On Semantic Web Technology</title>
      <p>
        The Semantic Web[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] was originally intended to enrich the
WorldWideWeb with machine-readable information. While
this process is still under way, several concepts and
frameworks have emerged which can be used to describe
semantically annotated data.
      </p>
      <p>The Resource Description Framework (RDF)2 is a format
for describing of relationships between a source (subject)
and a target (object). Uni ed Resource Identi ers (URIs)
are used to specify each component, making these
descriptions unique. The Web Ontology Language (OWL)3 can be
used to describe ontologies, i.e. formal representations of
concepts and their relationships. By combining both
frameworks, it is possible to represent information and their
relationships from arbitrary data sources.</p>
      <p>As it is possible to describe concepts and relationships in
di erent ways { resulting in di erent ontologies describing
the same circumstance { ontologies need to be aligned. This
process can be compared to creating a uni ed schema in
DBS. If two ontologies can be mapped to each other, so can
the information represented by two data sources using them.
In our approach we rely on ontology matching as a
replacement for schema mapping, however do not research the topic
ourselves.</p>
      <p>Similar to SQL queries in relational DBMS, SPARQL4 has
been developed as a query language for the Semantic Web.
The syntax is similar to SQL, however it is tailored towards
RDF-graphs. We use SPARQL as query language, matching
the RDF representation of the integrated data.</p>
    </sec>
    <sec id="sec-5">
      <title>2.3 Bridging RDBMS and RDF/OWL</title>
      <p>
        Since RDF/OWL and RDBMS both describe data sets, there
have been e orts to bridge the concepts and transform data
between these models. In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] is described how queries can
be mapped to the Virtuoso database, an RDF triple store,
i.e. a database optimized towards data in RDF
representation. A formal description on semantics and algorithms
for querying distributed data sources with SPARQL is
presented in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], a framework especially useful for mediator
systems which themselves have to distribute queries among
the several available data sources. On the other hand, there
are tools mapping relational DBS to RDF graph. A survey
on such tools can be found in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>
        Due to available XML representations of RDF graphs, it
is tempting to use XML technology and XML databases to
represent RDF. However, as pointed out in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a single RDF
triple may have several representations which are distinct in
a pure XML interpretation, although conveying the same
information. Therefore it is mandatory to use RDF tools
despite an XML representation being available.
      </p>
      <p>Semantic Web technologies and data integration have
al</p>
      <sec id="sec-5-1">
        <title>1http://www.bisonet.eu</title>
      </sec>
      <sec id="sec-5-2">
        <title>2http://www.w3.org/RDF/ 3http://www.w3.org/2007/OWL 4http://www.w3.org/TR/rdf-sparql-query/</title>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>3. AN APPLICATION EXAMPLE</title>
      <p>A typical task in PIM data integration can be to merge
several address books from di erent sources, such as Social
Networks, e.g. Facebook5 or Xing6, a personal address book
in the PDA or mobile phone and a company-wide address
book provided by LDAP or other software. Even though
there are di erent sources to the user only the actual entry
is relevant.</p>
      <p>While views can often be integrated by merging all available
data into a contact item, this often leads to information loss
with respect to the source of information and relevance of
con icting parts. When, for example. the merge results in
several phone numbers, the user has to choose which one
would be correct in the current context, so he does not end
up making business calls on the personal land-line.
Semantic annotations, especially about the source, can be used to
rank con icting items in the integrated view.</p>
      <p>Another question { and more relevant regarding this paper
{ is how updates on an integrated data set should be
applied. When the user changes a speci c phone number, in
which data source must this change be committed?
Information about the semantics of integrated data and their sources
can be used to guide this decision, Section 5.2 however points
out some problems which will arise due to intrinsic lack of
information. Here a system can try to deduce where
information must be put from the context and habits of a user,
e.g. are phone numbers stored in Xing or rather in the
personal address book and can a certain update be made at
all?</p>
    </sec>
    <sec id="sec-7">
      <title>4. CARSA AS RDF-BASED MEDIATOR</title>
      <p>
        The CARSA system7 as initially described in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] has
undergone changes to broaden its use and prepare it to be
available to other researchers. Mainly there has been a split
into several, distinct sections to be incorporated depending
on the task at hand. Parts and features common to all use
cases, mostly containing data sources and functions typical
to information retrieval applications, have been moved to
the CARSA Public Commons section. Based on this the
CARSA Public SearchEngine is a generic architecture for
meta-search engines, containing adapters to keyword based
search as well as methods for clustering and classi cation of
results.
      </p>
      <p>
        At the time of writing this paper we have already begun to
enhance the CARSA system by Semantic Web capabilities,
i.e. handling of RDF graphs and SPARQL-based requests.
The existing plugin architecture will then be used to
incorporate wrappers between arbitrary data sources and the
RDFbased internal representation. If necessary we extend these
plugins to be general data access plugins, enabling them to
not only read from, but also to update the data sources.
The available query routing mechanism will be leveraged to
implement the mediator structure described in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
However, the CARSA system itself was also designed for
read-only access to the underlying search engines. The data
representation and plugin meta-information must be
enhanced to ascertain the source of a speci c RDF triple and to be
able to feedback changes to the original sources. It is still to
5http://www.facebook.com
6http://www.xing.com
7http://www. ndke.ovgu.de/en/research/content/
tools demos/carsa.html
be assessed whether the CARSA Public SearchEngine
architecture is to be used or a distinct system will be implemented
based on the CARSA Public Commons package only.
      </p>
    </sec>
    <sec id="sec-8">
      <title>5. UPDATES THROUGH SEMANTICS</title>
      <p>Instead of a uni ed schema, which would require adaption
whenever a data source is plugged in or removed, we use
the semantics of the represented data to determine how
updates must be conducted. The user applies changes to the
RDF view, i.e. updates, deletions and additions. The
mediator then determines how the underlying data sources have
to be manipulated in order to re ect the desired change in
the RDF representation. By changing the RDF graph the
user conveys the intention to change the underlying data
sources in such way that their representation will result in
the changed RDF graph.</p>
    </sec>
    <sec id="sec-9">
      <title>5.1 Interaction</title>
      <p>The interactions which are available on the RDF-based
information view must match the interactions for similar
integrated views (see Related Work) and should also allow to
change the underlying data sources through the presented
view.</p>
      <p>The read-only interaction schemes on the view can be
classi ed as Lookups as closed queries to the RDF
representation. These are achieved via SPARQL queries and part of
the implementation of available RDF frameworks. Rather
than looking for speci c structures directly, the user may
have open queries and therefore must be able to Navigate
through the data in order to Explore it. Hitherto existing
solutions are already capable of supporting these
interactions.</p>
      <p>Additional to the above, we also want to allow changes in
the data representation. These changes may be:
1. Update already existing items or their properties: For
these changes, the data source of the item { or the
property { is identi ed and the update applied there.
Problems may arise if the change can only be re ected
by moving the item between data sources.
2. Delete items or their properties: Similar to an update,
the data source must be identi ed and the item deleted
from there. If an item appears on several data sources
and has been merged, it must be deleted from each of
them or the removal must be disambiguated.
3. Add items or properties: In contrast to the above
manipulations, there is no known data source for an added
item. The mediator needs to determine the data source
in which the item should be created in order to show
up in the RDF view. Dependent on the incorporated
sources, it may be necessary to disambiguate between
several update actions, as elaborated in the
Disambiguation section below.</p>
      <p>For accumulated values or items, which have been
assembled from multiple source, the update operations may not
be as straightforward as listed above. For example an
accumulated value, such as the number of books a person owns,
can only be changed be adding or removing books { these
values cannot be directly manipulated. Also, not every data
source may support the desired update. The mediator has
to keep track of which interactions are available on the
presented data. So far we came up with two solutions, both
having their advantages and drawbacks:
1. On each intended update the system can perform a dry
run and report whether the operation would be
successful. While this solution is relatively easy to
implement, it is not acceptable from a user's point of view.
Neither is the system able to tell whether a planned
operation would be possible, nor is it possible to
enumerate available interactions to be presented to the
user. These limitations deter the user from building a
successful mental simulation towards the solution of a
task at hand, therefore make it very di cult to achieve
a speci c goal when interacting with the system.
2. Based on limitations stated in meta-information about
data sources, the mediator can keep track of constraints
towards the interactions available for the system. From
those constraints a set of interactions can be derived
for each item in the RDF graph and be presented to
the user. This solution, however, results in a much
higher e ort on developing, implementing and running
the mediator system.</p>
    </sec>
    <sec id="sec-10">
      <title>5.2 Disambiguation</title>
      <p>As there may be data sources with similar semantics, e.g.
person pro les from social networks, it may not always be
possible to decide which data source should be changed in
order to achieve a certain state. This especially applies to
added information, as there is no history or meta-data for
this piece of information which would allow to map it to a
data source. In order to solve the problem, an explicit
disambiguation is necessary, for which we have so far elaborated
several approaches:
1. The user is presented with a list of possible actions
through the user interfaces, from where he is asked
to select one to his like. This solution has two
major drawbacks: First, there must be a user interface
at all, which might not necessarily be the case with
agent-based systems. Second, the user might not know
or might not want to be concerned with the selection
of an appropriate data source to be changed. This
form of presentation breaks the uni ed view on all data
sources.
2. There is a reasoning mechanism which allows to
determine the best action to be taken. This might be
achieved by a ranking of all possible changes, based
on meta-information about the data sources provided
by their wrappers. This ranking, however, will be very
closely tied to the actual application and must be
carefully designed to re ect the user's needs, otherwise odd
decisions may lead to confusion. Still, there is a
Semantic Gap between a user's interaction and his intent,
for example an application could not easily deduce in
which contact to store a just added telephone
number. Unless there are clear directions about where to
put speci c data, the user may still need to make the
decision.
3. The reasoning may be supported by nding similar
data and deducing the target data source by these
elements. This approach is based on the assumption that
a user intends to keep the principal structure of his
data models. So when a telephone number is added
to a contact, the system tries to determine the source
which is most likely to contain telephone numbers and
puts the number there. Previous choices by the user
may be incorporated.</p>
      <p>Selecting from these approaches is a choice between
automation and accuracy. None of these approaches provides a
perfect solution and it is most likely necessary to combine them
to create a ranking of possible actions and present them to
the user for a more informed choice.</p>
    </sec>
    <sec id="sec-11">
      <title>5.3 Mapping Relational data to RDF</title>
      <p>As mentioned in Section 2.3, there are solutions for an
automated mapping of relational data schemas to RDF
structures. However, in most database schemas semantics are not
included and often even distorted by normalization or
optimization, therefore many data sources are missing the
necessary information needed to implement a semantic driven
system.</p>
      <p>
        This semantic gap is closed by writing wrappers which
explicitly take care of adding and removing semantics during
transformation. In [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] the process of adding semantics to
data is called lifting, as it lifts the data to a higher
description level. When data is sent to a data source, the semantics
must be replaced by a representation according to the
target schema, i.e. removed in a process called lowering as
an opposite to lifting. The semantics, which are only
implicit for many data sources, must be de ned by a wrapper.
This again leaves us with the necessity of writing wrappers
for each non-RDF data source, however the transformation
now includes the semantics needed to incorporate the
resulting information into any further processing steps.
Having a wrapper which not only transforms data, but also
adds the semantics necessary to interpret the data, allows
for automated conversion and processing in later processes,
thus saving the programmer from developing further
wrappers. Once the data is lifted into the semantic
representation, there is no further need for data source dependent
treatment.
      </p>
    </sec>
    <sec id="sec-12">
      <title>5.4 Putting it all together</title>
      <p>
        Based on the CARSA framework described in Section 4 we
plan to implement an architecture similar to the one
described in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Data sources, if not already in RDF format,
are wrapped and added using the plugin architecture, using
the lifting and lowering concept from [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Query federation
can be achieved with the system described in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
However, for disambiguation as mentioned in Section 5.2
further systems may be needed which analyze the user's context
and interaction to determine the most likely goal and rank
or present the possible resolutions accordingly. Currently
we do not care about this speci c problem.
      </p>
    </sec>
    <sec id="sec-13">
      <title>6. CONCLUSION</title>
      <p>We sketched a system that combines techniques both from
data integration and the Semantic Web to integrate
multiple data sources while keeping their semantics, which can be
used for further processing without the need of data source
speci c converters. Having the semantics of each item allows
not only to read, but also to apply updates on the uni ed
view, as the mediator can determine the original source in
which the changes have to be made. Some approaches for the
disambiguation of changes have been presented, as it may
not always be decidable to which source an update must be
forwarded.</p>
      <p>Since we do not build a Data Warehouse, but access the
sources directly, changes { either external or from within
the system { have immediate e ect, making the mediator
also usable for short-living data or high update rates, as
they may appear for example in Personal Information
Management (PIM).</p>
      <p>The system will serve as a basis for uni ed navigation,
exploration and manipulation of integrated data sources. While
starting with a system for read-only, yet dynamic access, we
strongly aim at update support using the semantic
annotations.</p>
    </sec>
    <sec id="sec-14">
      <title>7. FUTURE WORK</title>
      <p>
        First thing to do will be the extension of the CARSA
system by RDF capabilities as described in Section 4. Together
with this development, we will assert how exactly the
mentioned solutions for query federation can be incorporated
into our framework. Afterwards, a prototype system
integrating several sources from PIM and knowledge bases is
built to research aspects of performance and and e ciency,
alongside with a user interfaces that allows interaction with
the data made available via the RDF mediator, leveraging
existing tools for graph exploration and information
visualization based on the represented data structures.
An interesting notion is the alignment of the de nition of
information provided by [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] as data with meaning, which is
provided by an RDF graph. Therefore it might be
worthwhile to investigate whether RDF-based mediation is rather
information integration than data integration.
      </p>
      <p>We left out the whole aspect of transactions. In our
prototype we assume that each operation will be successful and
executed towards the ACID criteria. A system which is able
to ensure this environment with multiple, independent data
sources is left for later research.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>W.</given-names>
            <surname>Akhtar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kopechky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Krennwallner</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Polleres</surname>
          </string-name>
          . XPARQL:
          <article-title>Traveling between the XML and RDF worlds { and Avoiding the XSLT Pilgrimage</article-title>
          .
          <source>In The Semantic Web: Research and Applications</source>
          , volume Volume
          <volume>5021</volume>
          /
          <year>2008</year>
          , pages
          <fpage>432</fpage>
          {
          <fpage>447</fpage>
          . Springer Berlin / Heidelberg,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bade</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. W.</given-names>
            <surname>De Luca</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          <article-title>Nurnberger, and</article-title>
          <string-name>
            <given-names>S.</given-names>
            <surname>Stober</surname>
          </string-name>
          .
          <article-title>CARSA - an architecture for the development of context adaptive retrieval systems. In Adaptive multimedia retrieval: user, context, and feedback</article-title>
          , volume Volume
          <volume>3877</volume>
          /2006 of Lecture notes in computer science, pages
          <volume>91</volume>
          {
          <fpage>101</fpage>
          . Springer Berlin / Heidelberg,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bauer</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Gu</surname>
          </string-name>
          <article-title>nzel. Data-Warehouse-</article-title>
          <string-name>
            <surname>Systeme - Architektur</surname>
          </string-name>
          , Entwicklung, Anwendung. Number 2. dpunkt Verlag,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Berners-Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hendler</surname>
          </string-name>
          , and
          <string-name>
            <given-names>O.</given-names>
            <surname>Lassila</surname>
          </string-name>
          .
          <source>The Semantic Web. Scienti c American</source>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Conrad</surname>
          </string-name>
          . Foderierte Datenbanksysteme: Konzepte der Datenintegration. Springer,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
            <surname>Erling</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Mikhailov.</surname>
          </string-name>
          <article-title>Integrating Open Sources and Relational Data with SPARQL</article-title>
          .
          <source>In The Semantic Web: Research and Applications</source>
          , volume Volume
          <volume>5021</volume>
          /
          <year>2008</year>
          , pages
          <fpage>838</fpage>
          {
          <fpage>842</fpage>
          . Springer Berlin / Heidelberg,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>L.</given-names>
            <surname>Floridi</surname>
          </string-name>
          .
          <article-title>Semantic Concepts of Information</article-title>
          . In Stanford Encylopedia of Philosophy.
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>W.</given-names>
            <surname>Inmon</surname>
          </string-name>
          .
          <source>Building the Data Warehouse. Number 4</source>
          . Wiley,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>A.</given-names>
            <surname>Langegger</surname>
          </string-name>
          , W. Wo , and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Blochl. A Semantic Web Middleware for Virtual Data Integration on the Web</article-title>
          .
          <source>In The Semantic Web: Research and Applications</source>
          , volume Volume
          <volume>5021</volume>
          /2008 of Lecture Notes in Computer Science, pages
          <volume>493</volume>
          {
          <fpage>507</fpage>
          . Springer Berlin / Heidelberg,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>B.</given-names>
            <surname>Quilitz</surname>
          </string-name>
          and
          <string-name>
            <given-names>U.</given-names>
            <surname>Leser</surname>
          </string-name>
          .
          <article-title>Querying Distributed RDF Data Sources with SPARQL</article-title>
          .
          <source>In The Semantic Web: Research and Applications</source>
          , volume Volume
          <volume>5021</volume>
          /2008 of Lecture Notes in Computer Science, pages
          <volume>524</volume>
          {
          <fpage>538</fpage>
          . Springer Berlin / Heidelberg,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>K.-U. Sattler</surname>
            ,
            <given-names>I. Geist</given-names>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Schallehn</surname>
          </string-name>
          .
          <article-title>Concept-based querying in mediator systems</article-title>
          .
          <source>The VLDB Journal</source>
          ,
          <volume>14</volume>
          (
          <issue>1</issue>
          ):
          <volume>97</volume>
          {
          <fpage>111</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Sheth</surname>
          </string-name>
          and
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Larson</surname>
          </string-name>
          .
          <article-title>Federated Database Systems for managing distributed, heterogeneous</article-title>
          , and autonomous Databases.
          <source>ACM Comput. Surv.</source>
          ,
          <volume>22</volume>
          (
          <issue>3</issue>
          ):
          <volume>183</volume>
          {
          <fpage>236</fpage>
          ,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Tamer zsu</article-title>
          and P. ,
          <string-name>
            <surname>Valduriez</surname>
          </string-name>
          .
          <source>Principles of Distributed Database Systems. Prentice Hall</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>W3C RDB2RDF Incubator Group</surname>
          </string-name>
          .
          <article-title>A Survey of Current Appraches for Mapping of Relational Databases to RDF</article-title>
          .
          <source>Technical report, W3C</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>