Re: Special query type for Spatial DB
Date: Thu, 15 Jan 2004 16:47:29 GMT
Message-ID: <1103_1074185249_at_news.comcast.giganews.com>
On Thu, 15 Jan 2004 13:07:35 -0000, Paul <paul_at_not.a.chance.ie> wrote:
>
> 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.
Might be a good senior-honors thesis topic that may lead on to an MS thesis topic. :-) Any potential grad students? Received on Thu Jan 15 2004 - 17:47:29 CET
