DMCA
Matching RDF Graphs (2002)
by
Jeremy Carroll Hewlett-Packard
,
Jeremy J. Carroll
| Venue: | In 2nd ISWC, volume 2870 of LNCS |
| Citations: | 3 - 0 self |
BibTeX
@INPROCEEDINGS{Hewlett-Packard02matchingrdf,
author = {Jeremy Carroll Hewlett-Packard and Jeremy J. Carroll},
title = {Matching RDF Graphs},
booktitle = {In 2nd ISWC, volume 2870 of LNCS},
year = {2002},
pages = {5--15},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The Resource Description Framework (RDF) describes graphs of statements about resources. This paper explores the equality of two RDF graphs in light of the graph isomorphism literature. We consider anonymous resources as unlabelled vertices in a graph, and show that the standard graph isomorphism algorithms, developed in the 1970's, can be used effectively for comparing RDF graphs.
