SPARQL-based set-matching for semantic grid resource selection

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Grid is an emerging technology that enables the sharing of a wide variety of resources. However, effective and accurate grid resource matching is difficult because of the dynamic characteristics and heterogeneity of grid resources. Grid resource matching mechanisms that utilize semantic Web technologies have been proposed to deal with this issue, although none support set matching of grid resources based on their semantic description. This paper proposes a novel set-matching algorithm that uses standard RDF query language SPARQL [1] to semantically match a set of grid resources and SPARQL query features to efficiently perform set matching. We evaluated the efficiency and effectiveness of the algorithm by performing a set of experiments and present the results. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Pahlevi, S. M., Matono, A., & Kojima, I. (2008). SPARQL-based set-matching for semantic grid resource selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4928 LNCS, pp. 461–472). https://doi.org/10.1007/978-3-540-78238-4_47

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