Message-ID: <55B0B149.1010903@sigaev.ru>
Date: Thu, 23 Jul 2015 12:18:01 +0300
From: Teodor Sigaev <teodor@sigaev.ru>
User-Agent: Mozilla/5.0 (X11; FreeBSD amd64;
 rv:36.0) Gecko/20100101 Firefox/36.0 SeaMonkey/2.33.1
MIME-Version: 1.0
To: hlinnaka@iki.fi, Paul Ramsey <pramsey@cleverelephant.ca>
CC: Pgsql Hackers <pgsql-hackers@postgresql.org>
Subject: Re: compress method for spgist - 2
References: <54907069.1030506@sigaev.ru>	<54993A76.7050308@vmware.com>
	<54DE237E.4000207@sigaev.ru>	<54EDD887.8030703@vmware.com>
 <CACowWR2LhVi4JHEVV=PYzLSyBfnpMd5+bhr2R8t5vzs0o79Ndw@mail.gmail.com>
 <55B09964.80707@iki.fi>
In-Reply-To: <55B09964.80707@iki.fi>
Content-Type: text/plain; charset=KOI8-R; format=flowed
Content-Transfer-Encoding: 7bit
Precedence: bulk
Sender: pgsql-hackers-owner@postgresql.org

>> 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@sigaev.ru
                                                    WWW: http://www.sigaev.ru/


-- 
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers