Hi Anuj, can you share a little bit more about your use cases (I am interested).
How big are your graphs? (How many nodes? How many links?). Have you tried to use PageRank, for example, as algorithm to compare different graph databases and TDB which, although RDF is a directed labeled multi-graph, isn't IMHO a 'proper' graph database and it has not designed or optimized for typical graph access patterns (i.e. graph traversal). Is there a well known and/or commonly used benchmark for graph databases? It would be interesting to see PageRank or other graph algorithms implemented on top of TDB (in node ids space, without touching the node table). Paolo Anuj Kumar wrote: > Hello Everyone, > > I have my RDF data loaded in TDB and using Java APIs to query the same. Is > there a way to run graph algorithms on top of it? > I am looking for shortest-path and PageRank. > > I am currently doing it using the JUNG framework but just curious to know if > it is possible to run it straight on top of TDB. > > Thanks, > Anuj >
