Hi Ander
I would try PostGIS with the newest KNN index, limited to X first
results, and eventually also limited by an absolute distance criterion
(see ST_DWithin) or bbox, accelerated by a spatial index like this:
SELECT ST_AsText(osm_poi.way) AS geom, name AS label
FROM
osm_poi,
(SEL
Hi,
Why not to put a good dataset available, let people run some tests with
different databases and publish the results like in this clipping contest?
http://gfoss.blogspot.it/2012/11/arcgis-vs-qgis-etc-clipping-contest.html
Read also from the end of this message the warning about comparing apple
On 12/14/2012 01:08 PM, Dominik Perpeet wrote:
The idea behind the same location was so that any documentation or
links that still point to that location would automatically be
up-to-date again. That would probably be easier than finding any and
all documentation for windows and update them. Al
On 15.12.2012, at 14:18, Ander Pijoan wrote:
> This is a good point. I know more or less how PostGIS works and how I should
> structure the query.
>
> My question was more related to fastness. The type of queries will just be
> some "geoNear" queries, just to get all the points within a bound
2012/12/14 Martin Schafran
> what happens if X=X matches the half database?
> a lot of comparisons.
>
> filter nodes by bbox
>
> WHERE ST_MakeBox2D(ST_GeomFromText(?, 4326), ST_GeomFromText(?, 4326)) &&
> n.geom
>
> statement.setString(1, lowerLeft.toString());
> statement.setString(2, upperRight
On Fri, 14 Dec 2012, Ander Pijoan wrote:
> I've seen that MongoDB has a spatial 2D index and I don't know if for the
> operations I'm going to do it could be faster than PostGIS.
The 2D spatial stuff in MongoDB is simple, but it *is* really fast. What
sort of operations are you thinking of runni
6 matches
Mail list logo
