There is no easy answer. The datastore has no 'geoindex' built in, so the application developer has to develop their own.
The bounding box one is probably one of the most complete examples. Although there are other possibilities including more advanced geohash based versions. At somepoint the datastore may implement a geoindex for you, but it will probably use a similar implementation under the hood, until then its upto you. On 11/03/2009, Dan Course <[email protected]> wrote: > > Morning Group, > > Hope everyone's all good? Got a dev. problem driving me nuts and I > can't figure out or find a simple solution throughout the posts. > > We're saving Lat/Lng in a GeoPt datatype. We then need to search > within all those GeoPts for the nearest within a radius/square (range) > > eg, search?lat=2&lng=5&range=5metres > > What's the easiet way of sorting this? The bounding box method seems > overly complex and crazy, are we just hoping for a simple solution to > quite a complex solution? > > WHERE GEOPT NEAR (LAT=2, LNG=2) > > Any clues? > > Thanks, > > DanC > > > > -- Barry - www.nearby.org.uk - www.geograph.org.uk - --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google App Engine" 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-appengine?hl=en -~----------~----~----~----~------~----~------~--~---
