On January 15, 2015 at 12:36:29 PM, Daniel Begin (jfd...@hotmail.com(mailto:jfd...@hotmail.com)) wrote:
> Paul, the nodes distribution is all over the world but mainly over inhabited > areas. However, if I had to define a limit of some sort, I would use the > dateline. Concerning spatial queries, I will want to find nodes that are > within the boundary of irregular polygons (stored in another table). Is > querying on irregular polygons is compatible with geohashing? Well… yes you can, although the relative efficiency compared to r-tree will depend a bit on how the query polygons interact with the geohash split points. Also, if you’re planning to slam pretty large polygons through this process, expect it to be kind of slow. You’ll want to do some sharding, to spread the problem out over multiple nodes. -- Paul Ramsey http://cleverelephant.ca http://postgis.net -- Sent via pgsql-general mailing list (pgsql-general@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-general
