Re: Special query type for Spatial DB

From: Paul <paul_at_not.a.chance.ie>
Date: Fri, 16 Jan 2004 16:36:09 -0000
Message-ID: <MPG.1a7223507078e0f59898a3_at_news1.eircom.net>


hobbit_at_southern_seaweed.com.op says...

> "For example suppose you have a table containing
> the coordinates of points of interest such as motels.
> Given a list of certain locations - eg: highway exists -
> you might need to find the coordinates of the smallest
> rectangle that encloses all the input locations."

Yes, and that's fine. It's a completely different question to that asked by the OP.

He asked about the 10 closest firestations in California.

Now, based on the assumption that there are at least 500 such stations (this is a complete guess BTW) this would involve (500 * 499 * 498 * .... * 491) distance comparisons times the number of combinations of 10 one can get out of 500.... I've confused myself now - something like that anyway.

Basically what you need to know is that this sort of calculation is exp (N) - i.e. that the number of calculations needed increases exponentially with the number of entities being examined. It becomes very messy very quickly, and maths has no magic formula for simply putting the data into a formula and retrieving the numbers.

Paul...

> Pete Brown

-- 
plinehan  y_a_h_o_o  and d_o_t  com
C++ Builder 5 SP1, Interbase 6.0.1.6 IBX 5.04 W2K Pro
Please do not top-post.

"XML avoids the fundamental question of what we should do, 
by focusing entirely on how we should do it." 

quote from http://www.metatorial.com 
Received on Fri Jan 16 2004 - 17:36:09 CET

Original text of this message