Preserving information content in RDF using bounded homomorphisms

Authors:
Audun Stolpe;Martin G. Skjæveland
Affiliations:
Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway
Venue:
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Year:
2012

Citing 4
Cited 0

Data exchange: semantics and query answering

Theoretical Computer Science - Database theory
Data fusion

ACM Computing Surveys (CSUR)
Foundations of RDF Databases

Reasoning Web. Semantic Technologies for Information Systems
RDF entailment as a graph homomorphism

ISWC'05 Proceedings of the 4th international conference on The Semantic Web

Quantified Score

Hi-index	0.00

Visualization

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.