From: | Alexander Korotkov <aekorotkov(at)gmail(dot)com> |
---|---|
To: | Heikki Linnakangas <heikki(dot)linnakangas(at)enterprisedb(dot)com> |
Cc: | pgsql-hackers <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: Double sorting split patch |
Date: | 2011-10-06 08:22:19 |
Message-ID: | CAPpHfdtJL16zZ2uwD5LD8TnkchV-TFaLbYJeGk0ZkhcFb=KeDA@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Thu, Oct 6, 2011 at 11:06 AM, Heikki Linnakangas <
heikki(dot)linnakangas(at)enterprisedb(dot)com> wrote:
> On 05.10.2011 15:59, Alexander Korotkov wrote:
>
>> Path without allocating extra bytes is attached.
>> I run some more detailed tests on geonames and two smaller datasets from
>> rtreeportal.org.
>>
>
> Ok, thanks. Looks good to me now, so committed.
Thanks. I'm going to continue work on application of this split method in
following areas:
1) range types
2) seg contrib module
3) cube contrib module (there situation is not so easy, probably some
heuristic of split method selection would be required)
Do you think that separation of some common parts of algorithm implemetation
is resonable in order to avoid code duplication? For example, different
application of algorithm could share function of splits enumeration along
axis which takes pointer to consider_split as an argument.
------
With best regards,
Alexander Korotkov.
From | Date | Subject | |
---|---|---|---|
Next Message | Nikhil Sontakke | 2011-10-06 08:42:38 | Re: Review: Non-inheritable check constraints |
Previous Message | Heikki Linnakangas | 2011-10-06 07:06:59 | Re: Double sorting split patch |