Hi Damian, I understand the motive of your implementation. It is nicely done. I have been running my traversals over Jung earlier but what I am looking for is an implementation distributed across multiple machines.
I have datasets of dbpedia loaded in TDB and trying the same. It is around 25M triples and total size is around 16GB. Regards, Anuj On Wed, Oct 26, 2011 at 12:12 AM, Damian Steer <[email protected]>wrote: > > On 25 Oct 2011, at 18:52, Anuj Kumar wrote: > > > 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. > > Could you quantify that? How many triples are you dealing with? > > Don't underestimate the naïvety of the jenajung implementation. It was only > written to get some diagrams working, over small graphs. There may be scope > to improve performance by caching, for example. > > What data were you using, and what were you doing with it? Have you tried > profiling? > > Damian > >
