[pgrouting-users] Speed when using big maps

[Philipp Hamm]

Hi everyone,

I've just started testing pgRouting on a big network (Germany) and want to use the whole Europe map later, but it's pretty slow.
I takes around 2,5 min to calculate one route and it makes no difference if the route distance is 7km or 700km.

Is there anything I can do to speed it up?
I have already indices to 'source' and 'target' and id is primary key, but I don't know how to use bounding boxes.

Furthermore I've noticed: when selecting only a part of the graph (keeping in mind that the area of the dijkstra expansion is loaded) it gets much faster.
Is this similar to what the bounding box would do?

To understand this I have some questions about how pgRouting works:
Does pgRouting reloads the road data on every request and does the slow calculation results only from fetching the graph?
If so, is it possible to load the graph into the memory and reuse it for further requests?

As I want to execute a lot of kDijkstras consecutively I guess only bounding boxes won't make it fast enough.

Thanks in advance!
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.osgeo.org/pipermail/pgrouting-users/attachments/20131024/1d3a6b77/attachment.html>