| From: | Teodor Sigaev <teodor(at)sigaev(dot)ru> |
|---|---|
| To: | hlinnaka(at)iki(dot)fi, Paul Ramsey <pramsey(at)cleverelephant(dot)ca> |
| Cc: | Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: compress method for spgist - 2 |
| Date: | 2015-07-23 09:18:01 |
| Message-ID: | 55B0B149.1010903@sigaev.ru |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
>> Poorly, by hanging boxes that straddled dividing lines off the parent
>> node in a big linear list. The hope would be that the case was
> Ok, I see, but that's not really what I was wondering. My question is this:
> SP-GiST partitions the space into non-overlapping sections. How can you store
> polygons - which can overlap - in an SP-GiST index? And how does the compress
> method help with that?
I believe if we found a way to index boxes then we will need a compress method
to build index over polygons.
BTW, we are working on investigation a index structure for box where 2d-box is
treated as 4d-point.
--
Teodor Sigaev E-mail: teodor(at)sigaev(dot)ru
WWW: http://www.sigaev.ru/
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Kouhei Kaigai | 2015-07-23 09:38:39 | Re: Asynchronous execution on FDW |
| Previous Message | Ildus Kurbangaliev | 2015-07-23 09:06:01 | Re: RFC: replace pg_stat_activity.waiting with something more descriptive |