科技报告详细信息
Matching RDF Graphs | |
Carroll, Jeremy J. | |
HP Development Company | |
关键词: RDF; graph isomorphism; equality; | |
RP-ID : HPL-2001-293 | |
学科分类:计算机科学(综合) | |
美国|英语 | |
来源: HP Labs | |
![]() |
【 摘 要 】
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. Notes: 15 Pages
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201804100002506LZ | 79KB | ![]() |