From: | Selena Deckelmann <selena(at)chesnok(dot)com> |
---|---|
To: | Alexander Korotkov <aekorotkov(at)gmail(dot)com> |
Cc: | PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
Subject: | Re: GSoC 2011 - Mentors? Projects? |
Date: | 2011-03-08 23:44:30 |
Message-ID: | AANLkTim2P2EYBmAUuuU7AT3UONMh43eHs9i8dgSvR0Z0@mail.gmail.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Hi Alexander,
On Tue, Mar 8, 2011 at 12:13 PM, Alexander Korotkov
<aekorotkov(at)gmail(dot)com> wrote:
> I've following project proposal.
Thanks for getting a head start! One warning - we haven't been
accepted into GSoC yet. :) I'll be sure to contact you if we are
accepted!
> Currently GiST index don't have any bulk load functionality. It have to
> create new index by entry insertion one by one. This makes new index
> creation relatively slow.
> There are various works in computer science about bulk operation on R-tree.
> Since gist in basic is generalization of R-tree, some of them seems to
> be applicable to GiST.
> Following work seems to be most applicable to GiST:
> "Efficient Bulk Operations on Dynamic R-Trees", L. Arge, K. H. Hinrichs, J.
> Vahrenhold and J. S. Vitter
> http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.135.9894&rep=rep1&type=pdf
> I believe that implementation of methods of this work should allow to
> significally reduce GiST index creation time (probably, it'll be possible to
> achive acceleration of other operations too). Also, it's possible to achive
> some results in computer science, since GiST is more general data structure
> than R-tree.
> I'm going to create wiki page for this project proposal soon.
That sounds great. Please go ahead and create the page now.
-selena
From | Date | Subject | |
---|---|---|---|
Next Message | Tatsuo Ishii | 2011-03-08 23:52:44 | Re: GSoC 2011 - Mentors? Projects? |
Previous Message | Tom Lane | 2011-03-08 23:00:39 | Re: Theory of operation of collation patch |