lundi 20 avril 2015

What is a fast & scalable way of identifying nearby defined set of places?

Given a set of places with lat/long predefined (locations that are not defined in google maps etc should be included), I need to get the top N number of places which are within a given distance radius from a given location (also with lat/long defined). An example for the places list would be restaurants in a country. Considering processing time and scalability (assuming the number of prefined places will grow over time) what is the best way to do this?

To narrow things down assume the places list and the location can be filtered by an area code. The location will be sent from a mobile to a NodeJS Express service where I'm hoping to do the processing on the server end for returning a list of nearby places back.

I found the link below which calculates direct distance between two lat/long points but need to know if there is a better way since I may need to consider driving distance too.

http://ift.tt/1DCVkUf

Aucun commentaire:

Enregistrer un commentaire