The fundamentals of iSPARQL: A virtual triple approach for similarity-based semantic Web tasks

70Citations
Citations of this article
69Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This research explores three SPARQL-based techniques to solve Semantic Web tasks that often require similarity measures, such as semantic data integration, ontology mapping, and Semantic Web service matchmaking. Our aim is to see how far it is possible to integrate customized similarity functions (CSF) into SPARQL to achieve good results for these tasks. Our first approach exploits virtual triples calling property functions to establish virtual relations among resources under comparison; the second approach uses extension functions to filter out resources that do not meet the requested similarity criteria; finally, our third technique applies new solution modifiers to post-process a SPARQL solution sequence. The semantics of the three approaches are formally elaborated and discussed. We close the paper with a demonstration of the usefulness of our iSPARQL framework in the context of a data integration and an ontology mapping experiment. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kiefer, C., Bernstein, A., & Stocker, M. (2007). The fundamentals of iSPARQL: A virtual triple approach for similarity-based semantic Web tasks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4825 LNCS, pp. 295–309). https://doi.org/10.1007/978-3-540-76298-0_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free