Hello everyone,
I have read and looked around at what others have done in Spatial DB
but there's one type of query which I have
not seen people working on yet. If you all have seen this in any
research projects or products, please share
with us.
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.
Please share your references if you have seen anyone working on or
have worked on this.
Thanks!
Joe \ - 24 Jan 2004 17:01 GMT
> I have read and looked around at what others have done in Spatial DB
> but there's one type of query which I have
[quoted text clipped - 16 lines]
> Please share your references if you have seen anyone working on or
> have worked on this.
If this can be expressed in relational algebra, then a relational
DBMS should work. Something like the old IBM BS12, which allows
new relational operators to be defined, would be convenient:
URL:http://mcjones.org/System_R/bs12.html
You might be hosed with a typical SQL DBMS, though. However, you
might be able to find application language libraries which will
convert relational algebra or calculus expressions to SQL queries.
--
Joe Foster <mailto:jlfoster%40znet.com> "Regged" again? <http://www.xenu.net/>
WARNING: I cannot be held responsible for the above They're coming to
because my cats have apparently learned to type. take me away, ha ha!