CODEWITHSUNDEEP
graphsemantic-webgraph-algorithmfreebasedbpedia
smohamed
smohamed

Reputation: 3314

Graph Traversing algorithms in Semantic web

I am asking about Algorithms that would be useful in Querying the Semantic web DB to get all the related RDFs to an original Object.

i.e If the original Object is the movie "inception", I want an algorithm to build queries to get the RDFs of the cast of the movie, the studio, the country ....etc so that I can build a relationship graph.

The most close example is the answer to this question , Especially this class , I wan similar algorithms or maybe titles to search in order to produce such an algorithm, I am thinking maybe some modifications on graph traversing algorithms can work, but I'm not sure.

NOTE: My project is in ASP.NET. So, it would help to use Exisiting .NET libraries.

Upvotes: 3

Views: 410

Answers (2)

Emre Sevinç
Emre Sevinç

Reputation: 8521

Did you take a look at "property paths"?

Property Paths give a more succinct way to write parts of basic graph patterns and also extend matching of triple pattern to arbitrary length paths. Property paths do not invalidate or change any existing SPARQL query.

Triple stores and SPARQL engines such as OWLIM and AllegroGraph support them.

Upvotes: 0

Shawn Simister
Shawn Simister

Reputation: 4603

You should be able to do a simple breadth-first-search to get all the objects that are a certain distance away from a given node.

You'll need to know something about the schema because some neighboring nodes are more meaningful than others. For example, in Freebase, we have intermediate nodes that link a film to an actor and a role. You need to know to go 2-ply deep to get at the actor and the role because just saying that the film is related to the intermediate nodes is not very interesting.

Upvotes: 1

Related Questions