Matching Rdf Graphs

ISWC '02: Proceedings of the First International Semantic Web Conference on The Semantic Web(2002)

引用 39|浏览31
暂无评分
摘要
The Resource Description Framework (RDF) describes graphs of statements about resources. RDF is a fundamental lower layer of the semantic web. 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. The techniques presented are useful for testing RDF software.
更多
查看译文
关键词
RDF graph,RDF software,graph isomorphism literature,standard graph isomorphism algorithm,Resource Description Framework,anonymous resource,fundamental lower layer,semantic web,unlabelled vertex,Matching RDF Graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要