Re: compress method for spgist - 2
От | Michael Paquier |
---|---|
Тема | Re: compress method for spgist - 2 |
Дата | |
Msg-id | CAB7nPqTTL1YhDieCO+23irywBaUb64k8MFQEF0-8BKdtwg=RWg@mail.gmail.com обсуждение исходный текст |
Ответ на | Re: compress method for spgist - 2 (Teodor Sigaev <teodor@sigaev.ru>) |
Ответы |
Re: [HACKERS] compress method for spgist - 2
|
Список | pgsql-hackers |
On Thu, Jul 23, 2015 at 6:18 PM, Teodor Sigaev <teodor@sigaev.ru> wrote: >>> 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. There has been no activity on this patch for some time now, and a new patch version has not been submitted, so I am marking it as return with feedback. -- Michael
В списке pgsql-hackers по дате отправления: