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: WIP: Fast GiST index build |
Date: | 2011-06-15 07:24:51 |
Message-ID: | BANLkTinMB-GSjFDThc0o9hRWa+_dJJXPZg@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
On Wed, Jun 15, 2011 at 11:21 AM, Alexander Korotkov
<aekorotkov(at)gmail(dot)com>wrote:
> I've tried index tuples sorting on penalty function before buffer
> relocation on split. But it was without any success. Index quality becomes
> even worse than without sorting.
> The next thing I've tried is buffer relocation between all neighbor
> buffers. Results of first tests is much more promising. Number of page
> accesses during index scan is similar to those without fast index build. I'm
> going to hold on this approach.
>
> test=# create index test_idx on test using gist(v);
> NOTICE: Level step = 1, pagesPerBuffer = 406
> CREATE INDEX
> Time: 10002590,469 ms
>
I forget to say that build time increases in about 40%, but it is still
faster than ordinal build in about 10 times.
------
With best regards,
Alexander Korotkov.
From | Date | Subject | |
---|---|---|---|
Next Message | Leonardo Francalanci | 2011-06-15 07:31:21 | Re: use less space in xl_xact_commit patch |
Previous Message | Alexander Korotkov | 2011-06-15 07:21:10 | Re: WIP: Fast GiST index build |