Re: Special query type for Spatial DB

ayeo_at_acm.org says...

> In particular, I'm looking for support for queries like:
> given a bounded region (3D may be), find me n points in a neighborhood that are the closest to each other.
> Note that there's no base reference point given, except for a bounded region.
> Concrete application queries may look like these:
> a)Given a bounded region in space, find me a cluster of 50 pulsars that are closest to each other.
> b)Given the state of California, find me a group of 10 fire-stations that are closest to each other.

This looks very like the travelling salesman problem to me - or am I off track?

If you could write a query to solve that, you'd be damn good. Sounds like you are going to have to do a lot of work client side, though maybe someone's implemented a solution to it in PG/SQL - though any solution can only ever be partial.

Though mind you, posting from the Cray domain means that you probably have considerable computing power at your fingertips.

Paul...  

> Arthur Yeo

-- 
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