On Sun, Nov 28, 2004 at 11:06:38PM -0800, Uwe C. Schroeder wrote:
> The "unhandy" part is maybe a personal perception. I like stored procs, but
> in
> this case the calculation is repeated over and over again (ok, it would be
> the same with views). Basically the part I don't like is that the
Am Sonntag, den 28.11.2004, 23:06 -0800 schrieb Uwe C. Schroeder:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> On Sunday 28 November 2004 10:43 pm, Michael Fuhr wrote:
> > On Sun, Nov 28, 2004 at 06:41:50PM -0800, Uwe C. Schroeder wrote:
> > > I need to search a lot of locations based on
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
> where sqrt(pow((lat1 - lat2),2) + pow((long1 - long2),2)) >= 50
I assume that you dont want to deal with distances > 1000km?!
> of the records that aren't in question anyways. How do you come to the
> lat/long values for the max differenc
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sunday 28 November 2004 10:49 pm, Greg Stark wrote:
> "Uwe C. Schroeder" <[EMAIL PROTECTED]> writes:
> > I could create a view for every node in the system which calculates the
> > distance in the result set, making it easy to handle for the applica
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sunday 28 November 2004 10:43 pm, Michael Fuhr wrote:
> On Sun, Nov 28, 2004 at 06:41:50PM -0800, Uwe C. Schroeder wrote:
> > I need to search a lot of locations based on distance (simple zipcode
> > match based on longitude and latitude). However I
"Uwe C. Schroeder" <[EMAIL PROTECTED]> writes:
> I could create a view for every node in the system which calculates the
> distance in the result set, making it easy to handle for the application:
> select * from where distance <= 50
> The problem is, that the data will possibly contain thousand
On Sun, Nov 28, 2004 at 06:41:50PM -0800, Uwe C. Schroeder wrote:
> I need to search a lot of locations based on distance (simple zipcode match
> based on longitude and latitude). However I need to calculate the distance
> between each of the nodes, so if you are in xxx I need to get the distanc
