Wasn't it Jee who wrote: >If possible to load more than 100 records dynamically ?
You could ask GDirections for the distances of 100 locations dynamically, but you have to delay between each call in order to not get "620" errors. If Google didn't impose such limits, then the whole system would grind to a halt if a few antisocial page authors wrote large numbers of calls with no delays. Expect to have to allow up to a second per call, depending on server loading. I'd imagine that many of your users wouldn't be happy to wait nearly two minutes for your page to do the processing. If you need faster response than that, then that might be possible if you're prepared to pay for it. You might try asking Google Premier if there are faster GDirections when you pay for them, or you might be able to find a third party commercial supplier. It won't be cheap. If you're performing the same 100 GDirections requests every time, then you can avoid the problem by making the calls once and then storing the results in the database. If you're performing the calls in order to find the nearest of your 100 database points to a user's location, then use point.distanceFrom() to find the straight line distances, then only perform GDirections on the 5 or 6 points that have the shortest straight line distance. That's not mathematically guaranteed to find you the one with the shortest driving distance, but it'll probably be right over 99% of the time, and produce reasonable results in the remaining cases. -- http://econym.org.uk/gmap The Blackpool Community Church Javascript Team --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google Maps API" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/Google-Maps-API?hl=en -~----------~----~----~----~------~----~------~--~---
