Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

Extended Semantic Web Conference

ESWC 2012: The Semantic Web: Research and Applications pp 72–86Cite as

  1. Home
  2. The Semantic Web: Research and Applications
  3. Conference paper
Preserving Information Content in RDF Using Bounded Homomorphisms

Preserving Information Content in RDF Using Bounded Homomorphisms

  • Audun Stolpe21 &
  • Martin G. Skjæveland21 
  • Conference paper
  • 2719 Accesses

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

Abstract

The topic of study in the present paper is the class of RDF homomorphisms that substitute one predicate for another throughout a set of RDF triples, on the condition that the predicate in question is not also a subject or object. These maps turn out to be suitable for reasoning about similarities in information content between two or more RDF graphs. As such they are very useful e.g. for migrating data from one RDF vocabulary to another. In this paper we address a particular instance of this problem and try to provide an answer to the question of when we are licensed to say that data is being transformed, reused or merged in a non-distortive manner. We place this problem in the context of RDF and Linked Data, and study the problem in relation to SPARQL construct queries.

Keywords

  • Composition Function
  • SPARQL Query
  • Triple Pattern
  • Graph Homomorphism
  • Target Graph

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Arenas, M., Gutierrez, C., Pérez, J.: Foundations of RDF Databases. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. LNCS, vol. 5689, pp. 158–204. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  2. Baget, J.-F.: RDF Entailment as a Graph Homomorphism. In: Gil, Y., Motta, E., Benjamins, V.R., Musen, M.A. (eds.) ISWC 2005. LNCS, vol. 3729, pp. 82–96. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  3. Bleiholder, J., Naumann, F.: Data fusion. ACM Computing Surveys 41(1) (2008)

    Google Scholar 

  4. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query answering. Theoretical Computer Science 336, 89–124 (2005)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Ghilardi, S., Lutz, C., Wolter, F.: Did I Damage my Ontology? A Case for Conservative Extensions in Description Logics. In: Proc. of the 10th Int. Conference on Principles of Knowledge Representation and Reasoning, KR 2006 (2006)

    Google Scholar 

  6. Hayes, P.: RDF Semantics. W3C Recommendation, W3C (2004), http://www.w3.org/TR/rdf-mt/

  7. Hutter, D.: Some Remarks on the Annotation %cons (1999)

    Google Scholar 

  8. Makinson, D.C.: Logical Friendliness and Sympathy in Logic. In: Logica Universalis. Birkhäuser, Basel (2005)

    Google Scholar 

  9. Pérez, J., Arenas, M., Gutierrez, C.: Semantics of SPARQL. Technical report, Universidad de Chile, TR/DCC-2006-17 (2006)

    Google Scholar 

  10. Prud’hommeaux, E., Seaborne, A.: SPARQL Query Language for RDF. W3C Recommendation, W3C (2008), http://www.w3.org/TR/rdf-sparql-query/

  11. Stolpe, A., Skjæveland, M.G.: From Spreadsheets to 5-star Linked Data in the Cultural Heritage Domain: A Case Study of the Yellow List. In: Norsk Informatikkonferanse (NIK 2011), Tapir, pp. 13–24 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Oslo, Norway

    Audun Stolpe & Martin G. Skjæveland

Authors
  1. Audun Stolpe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin G. Skjæveland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute AIFB, Karlsruhe Institute of Technology, Englerstrasse 11, 76131, Karlsruhe, Germany

    Elena Simperl

  2. CITEC, University of Bielefeld, Morgenbreede 39, 33615, Bielefeld, Germany

    Philipp Cimiano

  3. Siemens AG Österreich, Siemensstrasse 90, 1210, Vienna, Austria

    Axel Polleres

  4. Technical University of Madrid, C/ Severo Ochoa, 13, 28660, Boadilla del Monte, Madrid, Spain

    Oscar Corcho

  5. STLab, ISTC-CNR, Via Nomentana 56, 00161, Rome, Italy

    Valentina Presutti

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stolpe, A., Skjæveland, M.G. (2012). Preserving Information Content in RDF Using Bounded Homomorphisms. In: Simperl, E., Cimiano, P., Polleres, A., Corcho, O., Presutti, V. (eds) The Semantic Web: Research and Applications. ESWC 2012. Lecture Notes in Computer Science, vol 7295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30284-8_12

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-30284-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30283-1

  • Online ISBN: 978-3-642-30284-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature