|
Posted by Al Dykes on 07/29/05 06:11
In article <11ei85f8c660b49@corp.supernews.com>,
Gordon Burditt <gordonb.haqjl@burditt.org> wrote:
>>I have a database of zipcodes with latitude and longitude. I also have the
>>method of calculating the distance between two zipcodes. What I want to
>>know is if there is an efficient algorithm for obtaining the zip codes
>>within a specified distance of the first zipcode without having to retrieve
>>and calculate for every record in the database.
>
>It depends on what you are doing, and how accurate you need to be.
>Is that distance supposed to be DRIVING distance or distance as
>the missile flies?
>
>Precomputing some of this can be used to advantage.
>
have you looked at a zip code map for Manhattan?
--
a d y k e s @ p a n i x . c o m
Don't blame me. I voted for Gore.
Navigation:
[Reply to this message]
|