Hello Andrea
OK, did some testing around, and managed to make things work really fast.
I found out that the spatial query being performed was actually a "not
disjoint" query. Changing that to the equivalent "intersects" spatial
query boosts everything, and the query is completed almost instant
Milton Jonathan wrote:
> Hey there Andrea
>
> Thanks for the tip. Found the ShapeFileIndexer main() and ran it.
>
> By the way, the little program worked like a breeze, very easy to use,
> fast and with nice feedback. The normal QIX tree was being generated
> with a depth of 10 for my shapefile
Hey there Andrea
Thanks for the tip. Found the ShapeFileIndexer main() and ran it.
By the way, the little program worked like a breeze, very easy to use,
fast and with nice feedback. The normal QIX tree was being generated
with a depth of 10 for my shapefile. I then forced it to generate a tree
Milton Jonathan wrote:
> Hello there
>
> I was playing around with a bigger shapefile (200MB for the .shp, 815MB
> for all files), made of lots of small features for streets and roads.
>
> First of all, rendering is quite good and fast, congratulations (and
> poor ArcExplorer couldn't even open
Milton,
You can build a qix file using the shptree utility in the mapserver
distribution.
P
On Fri, Dec 4, 2009 at 10:00 AM, Milton Jonathan
wrote:
> Hello there
>
> I was playing around with a bigger shapefile (200MB for the .shp, 815MB
> for all files), made of lots of small features for stre
Hello there
I was playing around with a bigger shapefile (200MB for the .shp, 815MB
for all files), made of lots of small features for streets and roads.
First of all, rendering is quite good and fast, congratulations (and
poor ArcExplorer couldn't even open it!). But for other operations
that
