Skip to main content

Ontology Matching Supported by Query Answering in a P2P System

  • Conference paper
  • 1087 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5332))

Abstract

In this article we propose methods to automate the extraction of alignments or mappings between ontologies by using query answering in the peer data management system (PDMS) SomeRDFS which uses a data model based on RDF(S). Query answering is composed of a rewriting and an evaluation phase. We show that query answering provides information that offer automated support for discovering new mappings. It is used to generate either mapping shortcuts corresponding to mapping compositions or mappings which can not be inferred from the network but yet relevant. The strategy followed by a peer and filtering criteria defined by the administrator of a peer are used to select the most relevant mappings to be represented.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adjiman, P., Goasdoué, F., Rousset, M.C.: SomeRDFS in the semantic web. Journal on Data Semantics, 158–181 (2006)

    Google Scholar 

  2. Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB J. 10(4), 334–350 (2001)

    Article  MATH  Google Scholar 

  3. Euzenat, J., Shvaiko, P.: Ontology matching. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  4. Kalfoglou, Y., Schorlemmer, M.: Ontology mapping: the state of the art. The Knowledge Engineering Review 18, 1–31 (2003)

    Article  MATH  Google Scholar 

  5. Halevy, Y., Ives, G., Suciu, D., Tatarinov, I.: Schema mediation for large-scale semantic data sharing. The VLDB Journal 14(1), 68–83 (2005)

    Article  Google Scholar 

  6. Tatarinov, I., Ives, Z.G., Madhavan, J., Halevy, A.Y., Suciu, D., Dalvi, N.N., Dong, X., Kadiyska, Y., Miklau, G., Mork, P.: The piazza peer data management project. SIGMOD Record 32(3), 47–52 (2003)

    Article  Google Scholar 

  7. Herschel, S., Heese, R.: Humboldt discoverer: A semantic p2p index for pdms. In: DISWeb 2005 (June 2005)

    Google Scholar 

  8. Castano, S., Ferrara, A., Montanelli, S.: H-match: an algorithm for dynamically matching ontologies in peer-based systems. In: SWDB 2003, Berlin, Germany (September 2003)

    Google Scholar 

  9. Bernstein, P.A., Green, T.J., Melnik, S., Nash, A.: Implementing mapping composition. In: VLDB, pp. 55–66 (2006)

    Google Scholar 

  10. Besana, P., Robertson, D.: How service choreography statistics reduce the ontology mapping problem. In: ISWC/ASWC, pp. 44–57 (2007)

    Google Scholar 

  11. Aberer, K., Cudré-Mauroux, P., Hauswirth, M.: The chatty web: emergent semantics through gossiping. In: WWW, pp. 197–206 (2003)

    Google Scholar 

  12. Reynaud, C., Safar, B.: When usual structural alignment techniques don’t apply. In: The ISWC 2006 workshop on Ontology matching (OM 2006) (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Calvier, FÉ., Reynaud, C. (2008). Ontology Matching Supported by Query Answering in a P2P System. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems: OTM 2008. OTM 2008. Lecture Notes in Computer Science, vol 5332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88873-4_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88873-4_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88872-7

  • Online ISBN: 978-3-540-88873-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics