Be the first to like this
The semantic Web is built on the Resource Description Framework (RDF). RDF is a graph model. It would be expected that a wide range of network analytical tools could be directly applied to a RDF data set. However, most network algorithms assume that a graph does not have parallel edges which the RDF graph model allows. Two approaches will be examined: direct measures of RDF graph structure using ratios and extraction of graphs from an RDF data set. Py-Triple-Simple (http://code.google.com/p/py-triple-simple/), an experimental pure Python library, can extract “well behaved” graphs from an N-triples file and can quantify RDF graph structure using ratios.