Hi, I use this query :
to get a number of vertices around a central vertex for my graph based mind-map application. The "depth" in the query is the maximum distance from the central vertex that I use to get nodes. When the depth is about 20 or more, the query is slow. But I need it to be fast because I want to load and show the mind map instantly. I would also like that that depth can be really high.
I use a Jena-MySQL repository. I know if it was in-memory Jena it would be faster but I don't think that loading an whole graph in memory is scalable for my app.
How to speed things up? Thank you.
asked 28 Aug '12, 17:37
If you want to stick with using Jena, you might think about trying TDB. imo, you get better mileage if you use a database that's designed for RDF rather than sticking RDF into a relational database, but I'm biased.
fwiw, with a depth of 20 or more, that's a non-trivial query; there are a lot of joins going on behind the scenes. If trying a different database is a no-go, you can only try smaller depths or a different query.
answered 28 Aug '12, 19:19