<!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>A Peer-to-Peer Based Semantic Agreement Approach for Information Systems Interoperability</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>I Wayan Simri Wicaksana</string-name>
          <email>iwayan@u-bourgogne.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kokou Y´etongnon</string-name>
          <email>kokou@u-bourgogne.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Laboratoire d'Electronique, Informatique et Image (LE2I) Universit ́e de Bourgogne BP 47870 - 21078 Dijon Cedex</institution>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This paper focuses on P2P based data management and semantic mediation. We propose an approach based on a P2P for semantic interoperability of information sources that aims to combine the advantages of semantic mediation and peer-to-peer systems. It is based on a pure P2P with super peer architecture consisting of two types of peers. The super peer contains a reference ontology, which provides a common ontology (CO) of the domain. The peer contains export schema (ES), which represent local data. The approach based on semantic agreement between CO and ES, which called half agreement (HA). The halfagreements utilize for discovery sources and exchange information among peers.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Effective information and services sharing in distributed such as P2P based
environments raises many challenges, including discovery and localization of
resources, exchange over heterogeneous sources, and query processing. Traditional
approach does not scale well when applied in dynamic distributed environments
and has many drawbacks related to the large numbers of sources.</p>
      <p>
        Several applications of P2P networks can be distinguished, ranging from
content sharing applications (e.g. Napster, Gnutella) to distributed computing
applications (e.g. SETI@home, Avaki) and development support platforms (e.g.
JXTA). Generally, two main categories of P2P systems can be distinguished.
Unstructured P2P systems organize peers in networked spaces. Each peer
controls and maintains its shared data. User queries are based on (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) centralized
directory models where one or more servers are used to record and locate data,
or (
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) a query routing model that essentially floods the network to determine
relevant peers that are likely to contain the requested data. By contrast,
structured P2P architectures organize data in a key spaces divided into segments.
User queries are based on a Distributed Hashing Table (DHT) built on the top
of the overlay structure of peers.
      </p>
      <p>Survey on schema matching [1, 2] explained the general approach of schema
matching based on terminology, structural and semantic. Kolfoglou [3] delivered
state of the art ontology mapping, which consider some component in framework,
methods, tools, translators, mediators, techniques and theoretical.</p>
      <p>We propose an approach based on a P2P for information interoperability that
aims to combine the advantages of semantic agreement and peer-to-peer systems.
Main our contribution is how to create and implement peer semantic agreement
for discovery process. The main difference of our approach to Remindin [4] and
expertise-based [5] is in calculation of related peers based on similarity of
halfagreement (semantic agreement) by calculating BindingValue.</p>
      <p>The paper is organized as follows: section 2 presents the peer agreement based
semantic approach. Section 3 presents an example. Finally, section 4 concludes
the paper.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Peer Agreement Approach</title>
      <sec id="sec-2-1">
        <title>Overview</title>
        <p>A P2P system Q =&lt; P, A &gt; is a set P = {P1, ..., Pn} of peers and a set A
of agreements. Two types of peers can be distinguished in the approach. First,
Super peers (SP) are used to maintain common ontology of a community. Peers
(PP) represent another type of peers that provide or search information.</p>
        <p>
          Figure 1 depicts the general processes of information exchange at P2P as
follow: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) publish: peers can publish their description of the features of the data.
In our approach, the publishing will introduce with preprocessing which called
half agreement. (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) request: a peer send a request to find appropriate sources for
his query. The searching based on relevant advertisement among the currently
available peers. The peer can broadcast his half agreement to candidate peers
and calculate similarity concept between query and sources. (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) bind: interest
parties can create mapping composition based on their half agreement.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Semantic Similarity of concepts</title>
        <p>
          Our approach utilizes available approaches that based on:
– Label Matching, a label has a part value of semantic, which presented at
taxonomy model such as WordNet [6]. There are two steps at label matching
[7]. First, a language preprocessing step is used to transform the labels into
words prior to linguistic analysis. For example, this step can be used to
expand abbreviations and reduce article such as the, a. Next, the labels are
matched by determining relations between them. This can be done based on
WordNet relations. The WordNet [8] is a brad coverage lexical network of
English words. Wu-Palmer (WUP) and Jiang-Conrath (JNC) methods are
utilized for the WordNet and combined with threshold value.
– Internal structure, a ’language’ attribute [9, 10] is property label of the
language such as owl:cardinality, rdfs:label. The similarity value between two
entities is derived by the ratio between numbers of similar properties over
the maximal number of both entities.
– The external structure takes into account the position of a concept in a
hierarchy. The method refers to upward cotopic distance [11] which compares
the similarity of the set of superclasses.
An agreement unit defines one-to-one or one-to-many mappings between (CCiO,
j
{CES }) where CCiO is an ontology and CEiS is an export schema concept. An
agreement unit encapsulates three main components that are described by RDF/
OWL schemas: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) an ontology concept, (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) a fragment of an export schema, and
(
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) the logical mapping function that link the two components. Set of agreement
unit is called half-agreement. Full agreement is a composition of half agreement
between two peers. A half-agreement unit is represented as tuple:
&lt; SM CID, {COSmP , typeSmP } , {ESPnP , typenP P } , μID &gt;
(
          <xref ref-type="bibr" rid="ref1">1</xref>
          )
where SM CID is a unique agreement identifier; m=1..mmax, is the number of
concepts of a Super Peer; COSmP is the m-th concept of the super peer; typeSmP
is the type of COSmP which can be class or property; ESPnP is the n-th concept
of the export schema of PP; typeiP P is the type of ESn
P P which can be a class
or a property; n=1...nmax is the number of concepts in the peer; μID is a logical
mapping function for resolving semantic heterogeneities between the super peer
and the peer.
Discovery appropriate peers, which can respond a query is important issues. In
our approach, the discovery processhas steps as follow: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) a peer that requests
information can utilize metadata information at super peer. The main purpose
to get list of active peers. (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) Then, the peer as request sends his half agreement
to the selected peers as sources. The sources peer will calculate BindingValue
between their half agreements to half agreement of the peer. The calculation
is based on similarity of concept. (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) Result of calculation matchmaking will
be sent from sources to the peer. Refer to second step the request peer can
ask to appropriate class and his properties. (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) After third step, appropriate
sources peers have been selected, then request peers send a query to sources
using mapping composition of two half agreement.
        </p>
        <p>Result of half agreement between P Pn to SP can be utilized to make direct
mapping between peers. The approach of mapping composition based on inverse
mapping as follow: ΩES1→ES2 = Ω1 ∗ Ω2−1. Result of mapping composition is
called full agreement unit.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Example</title>
      <p>This example illustrates the steps for discovery sources using the general strategy
of the agreement unit approach. Consider the peers PP1 and PP2 as providers
and the fragments of ontology and export schemas shown in figure 2.
Furthermore, assume that the two peers characterize roads differently. One peer PP1
classifies road according to speed limit while peer PP2 characterizes road
according to size of road. Now consider a peer which characterizes roads by type
(primary, secondary and so on) and which queries both peers PP1 and PP2 for
a list of secondary street in an area. After developing of half agreement and look
at meta information at super peer, the peer as request send his half agreement
to PP1 and PP2. PP1 and PP2 calculate BindingValue. BindingV alue = ²/π,
where ² = number of similar concept between request and provider peer, π =
number of concept at request peer. PP2 will be selected as the interest
parties because BindingValue of PP2 higher than threshold value (BindingValue of
PP1=0/1, BindingValue of PP2=1/1). Result of discover can be continued to
develop mapping composition and query process.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>XMLS, RDFS and OWL and other ontology developments offer facility to enrich
semantic description at P2P environment. We proposed a semantic agreement
approach based on concept similarity values that take into account the place of
a concept in a hierarchy and its structure consisting of directly linked properties
and concepts. We utilize available approach of semantic mapping to develop half
agreement. Result of half agreement can be utilized for discovery resources,
mapping of concept between peers and handling of query to exchange information.</p>
      <p>In the future work, we will focus on finalizing the architecture and prototype
system to enhance negotiations between provider peer and a peer</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Rahm</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>P.A.</given-names>
          </string-name>
          :
          <article-title>A Survey of Approaches to Automatic Schema Matching</article-title>
          .
          <source>The VLDB Journal</source>
          <volume>10</volume>
          (
          <year>2001</year>
          )
          <fpage>334</fpage>
          -
          <lpage>250</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Shvaiko</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Euzenat</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A survey of schema-based matching approaches</article-title>
          .
          <source>J. Data Semantics IV</source>
          <volume>3730</volume>
          (
          <year>2005</year>
          )
          <fpage>146</fpage>
          -
          <lpage>171</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Kalfoglou</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schorlemmer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Ontology Mapping: The State of the Art</article-title>
          .
          <source>In: Semantic Interoperability and Integration</source>
          . (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Tempich</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Staab</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wranik</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Remindin': semantic query routing in peer-topeer networks based on social metaphors</article-title>
          . In Feldman,
          <string-name>
            <given-names>S.I.</given-names>
            ,
            <surname>Uretsky</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Najork</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Wills</surname>
          </string-name>
          , C.E., eds.: WWW,
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2004</year>
          )
          <fpage>640</fpage>
          -
          <lpage>649</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Siebes</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haase</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harmelen</surname>
            ,
            <given-names>F.v.</given-names>
          </string-name>
          :
          <article-title>Expertise-Based Peer Selection</article-title>
          . In: Semantic Web and
          <string-name>
            <surname>Peer-</surname>
          </string-name>
          to-
          <source>Peer Decentralized Management and Exchange of Knowledge and Information</source>
          . Springer (
          <year>2006</year>
          )
          <fpage>125</fpage>
          -
          <lpage>142</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>An information-theoretic definition of similarity</article-title>
          . In Shavlik, J.W., ed.: ICML, Morgan Kaufmann (
          <year>1998</year>
          )
          <fpage>296</fpage>
          -
          <lpage>304</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Giunchiglia</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shvaiko</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Semantic Matching.
          <source>Technical Report DIT-03-013</source>
          , University of TN (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Budanitsky</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hirst</surname>
          </string-name>
          , G.:
          <article-title>Evaluating wordnet-based measures of lexical semantic relatedness</article-title>
          .
          <source>Computational Linguistics</source>
          <volume>32</volume>
          (
          <issue>1</issue>
          ) (
          <year>2006</year>
          )
          <fpage>13</fpage>
          -
          <lpage>47</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Euzenat</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valtech</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Similarity-Based Ontology Alignment in OWL-Lite</article-title>
          . In: ECAI. (
          <year>2004</year>
          )
          <fpage>333</fpage>
          -
          <lpage>337</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Bach</surname>
            ,
            <given-names>T.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dieng-Kuntz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Measuring Similarity of Elements in OWL DL Ontologie</article-title>
          .
          <source>Technical Report ACACIA Project, INRIA Sophia Antipolis</source>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Euzenat</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le Bach</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barasa</surname>
          </string-name>
          , J.,
          <source>etc: D2</source>
          .
          <article-title>2.3: State of the art on ontology alignment</article-title>
          .
          <source>Technical Report IST-2004-507482</source>
          , knowledgeweb (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>