Finding isomorphism between RDF graphs
Sithu Naing
Finding isomorphism between RDF graphs - Pathum Thani, Thailand : Asian Institute of Technology, 2003 - 36 p. - Thesis ; no. CS-03-04 . - Asian Institute of Technology. Thesis ; no. CS-03-04 .
A thesis study submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies
Thesis (M.Sc.) - Asian Institute of Technology, 2003
Resource Description Framework (RDF) recommended by the World Wide Web Consortium, is to model meta-data about the resources of the web. RDF is a fundamental lower layer of the semantic web. It describes graphs of statements about resources. Within RDF graphs, anonymous resources are considered as unlabelled in a graph. In this thesis, find out the equality of RDF graphs and traditional graphs. And show that Interactive vertex classification algorithm which is a standard graph isomorphism algorithm can be applied to check the isomorphic between RDF graphs effectively.
Isomorphisms (Mathematics)
Metadata
Finding isomorphism between RDF graphs - Pathum Thani, Thailand : Asian Institute of Technology, 2003 - 36 p. - Thesis ; no. CS-03-04 . - Asian Institute of Technology. Thesis ; no. CS-03-04 .
A thesis study submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Advanced Technologies
Thesis (M.Sc.) - Asian Institute of Technology, 2003
Resource Description Framework (RDF) recommended by the World Wide Web Consortium, is to model meta-data about the resources of the web. RDF is a fundamental lower layer of the semantic web. It describes graphs of statements about resources. Within RDF graphs, anonymous resources are considered as unlabelled in a graph. In this thesis, find out the equality of RDF graphs and traditional graphs. And show that Interactive vertex classification algorithm which is a standard graph isomorphism algorithm can be applied to check the isomorphic between RDF graphs effectively.
Isomorphisms (Mathematics)
Metadata

AI Search