Thanks Patrick. I also came across this presentation- http://www.slideshare.net/slidarko/traversing-graph-databases-with-gremlin and TinkerPop also supports Jung. So, with your and Damian's response, I got my answers.
I gave it a quick try. It works nicely with smaller graphs but as the triples grow in TDB, Jung starts struggling and that makes sense because it needs more memory depending on the size of the triples. So, is there a way to load the entire graph from TDB in a distributed cache or something that can span multiple machines? I can read it from TDB and push it into a graph database or a distributed cache but if this is provided by Jena TDB that is what I would prefer to go with. Is it supported? Thanks, Anuj On Sat, Oct 22, 2011 at 9:43 PM, Patrick Logan <[email protected]>wrote: > Gremlin has been adapted to work with Sesame. It's probably not much > of a stretch for Jena. > > https://github.com/tinkerpop/gremlin > > > On Fri, Oct 21, 2011 at 9:20 PM, Anuj Kumar <[email protected]> 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 > > >
