From: | Paul Ramsey <pramsey(at)cleverelephant(dot)ca> |
---|---|
To: | Daniel Begin <jfd553(at)hotmail(dot)com> |
Cc: | PostgreSQL General <pgsql-general(at)postgresql(dot)org> |
Subject: | Re: Indexing large table of coordinates with GiST |
Date: | 2015-01-15 21:58:55 |
Message-ID: | etPan.54b8381f.71f32454.5b48@Butterfly.local |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
On January 15, 2015 at 12:36:29 PM, Daniel Begin (jfd553(at)hotmail(dot)com(mailto:jfd553(at)hotmail(dot)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
From | Date | Subject | |
---|---|---|---|
Next Message | Robert DiFalco | 2015-01-15 23:04:04 | Re: Simple Atomic Relationship Insert |
Previous Message | Maciek Sakrejda | 2015-01-15 21:02:42 | sslcompression / PGSSLCOMPRESSION not behaving as documented? |