Home/ Questions/Q 533899
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-13T09:33:22+00:00

Use case example: Client A comes to request sales information, enters their zip code

  • 0

Use case example: Client A comes to request sales information, enters their zip code and are directed to Representative X.

Since there is an effectively infinite number of zip codes there will not be an agent assigned to every single zip code which would then move out to the county level, and then so on into a region of counties and finally end at the state level.

What type of relationships would be best at modeling this scenario?

Is there any way to remove the need to specifically define regions that a zip code could be approximated to a nearest county assigned a rep, if so would it only be possible with a full geolocation look up to do distance comparisons to find the nearest representative or perhaps could the zip code itself be used to closely approximate the distance?

Clarification: The real intent of this question is how to solve the region approximation without needing to maintain a perfect association table of counties to regions or is the solution to this problem so complex that the cost of maintaining the relationships manually is less prohibitive?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Well you can easily get the Lat/Long from the Google or Yahoo API (in my last project we had an issue with Google not finding a certain zipcode in NJ that Yahoo found, fyi).

    So if you cache the Lat/Long for each zipcode with a representative (and I would probably recommend caching the Lat/Long for each zipcode entered by a customer too, so you don’t have to hit a web service each time), then you can just get the Lat/Long of the user’s zipcode and run through a distance calculation for each rep. This does have an order of n-time complexity (O(n) for n representatives)

    • 0