SPARQL++ for Mapping Between RDF Vocabularies
Lightweight ontologies in the form of RDF vocabularies such as SIOC, FOAF, vCard, etc. are increasingly being used and exported by “serious” applications recently. Such vocabularies, together with query languages like SPARQL also allow to syndicate result
- PDF / 648,562 Bytes
- 19 Pages / 430 x 660 pts Page_size
- 62 Downloads / 167 Views
3
DERI Galway, National University of Ireland, Galway [email protected] 2 Leopold-Franzens Universit¨at Innsbruck, Austria [email protected] Department of Mathematics, University of Calabria, 87030 Rende (CS), Italy 4 Institut f¨ur Informationssysteme, Technische Universit¨at Wien [email protected]
Abstract. Lightweight ontologies in the form of RDF vocabularies such as SIOC, FOAF, vCard, etc. are increasingly being used and exported by “serious” applications recently. Such vocabularies, together with query languages like SPARQL also allow to syndicate resulting RDF data from arbitrary Web sources and open the path to finally bringing the Semantic Web to operation mode. Considering, however, that many of the promoted lightweight ontologies overlap, the lack of suitable standards to describe these overlaps in a declarative fashion becomes evident. In this paper we argue that one does not necessarily need to delve into the huge body of research on ontology mapping for a solution, but SPARQL itself might — with extensions such as external functions and aggregates — serve as a basis for declaratively describing ontology mappings. We provide the semantic foundations and a path towards implementation for such a mapping language by means of a translation to Datalog with external predicates.
1 Introduction As RDF vocabularies like SIOC,1 FOAF,2 vCard,3 etc. are increasingly being used and exported by “serious” applications we are getting closer to bringing the Semantic Web to operation mode. The standardization of languages like RDF, RDF Schema and OWL has set the path for such vocabularies to emerge, and the recent advent of an operable query language, SPARQL, gave a final kick for wider adoption. These ingredients allow not only to publish, but also to syndicate and reuse metadata from arbitrary distibuted Web resources in flexible, novel ways. When we take a closer look at emerging vocabularies we realize that many of them overlap, but despite the long record of research on ontology mapping and alignment, a
1 2 3
This research has been partially supported by the European Commission under the FP6 projects inContext (IST-034718), REWERSE (IST 506779), and Knowledge Web (FP6507482), by the Austrian Science Fund (FWF) under project P17212-N04, as well as by Science Foundation Ireland under the Lion project (SFI/02/CE1/I131). http://sioc-project.org/ http://xmlns.com/foaf/0.1/ http://www.w3.org/TR/vcard-rdf
R. Meersman and Z. Tari et al. (Eds.): OTM 2007, Part I, LNCS 4803, pp. 878–896, 2007. c Springer-Verlag Berlin Heidelberg 2007
SPARQL++ for Mapping Between RDF Vocabularies
879
standard language for defining mapping rules between RDF vocabularies is still missing. As it turns out, the RDF query language SPARQL [24] itself is a promising candidate for filling this gap: Its CONSTRUCT queries may themselves be viewed as rules over RDF. The use of SPARQL as a rules language has several advantages: (i) the community is already familiar with SPARQL’s syntax as a query language, (ii) SPARQL supports
Data Loading...
