[Routing] FW: [pgrouting-users] Multiple queries in a row

[Iñigo Vázquez]

Dear all,

I need to obtain a set of nearest nodes from a given location (maybe 30 or 40). Then I need to calculate the shortest path from the given node from each others. It means to execute shortes_path query multiple times in a row, wich takes about 2 seconds (1 query 2 seconds: 30 queries 60 -> too long).SELECT * FROM shortest_path('
   SELECT id AS id,
          source::int4 AS source,
          target::int4 AS target,
          cost::float8 AS cost
   FROM tt_2po_4pgr',
275742,
274494,
false,
false)What would be the best way to do this in a reasonable time?
Thank in advance!
Pd: excuse my english 		 	   		  

_______________________________________________
Pgrouting-users mailing list
Pgrouting-users at lists.osgeo.org
http://lists.osgeo.org/mailman/listinfo/pgrouting-users 		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.openstreetmap.org/pipermail/routing/attachments/20121121/3514b361/attachment.html>
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: ATT00001
URL: <http://lists.openstreetmap.org/pipermail/routing/attachments/20121121/3514b361/attachment.ksh>