Skip site navigation (1) Skip section navigation (2)

Re: GSoC proposal: Fast GiST index build

From: Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>
To: Robert Haas <robertmhaas(at)gmail(dot)com>
Cc: Alexander Korotkov <aekorotkov(at)gmail(dot)com>, pgsql-hackers <pgsql-hackers(at)postgresql(dot)org>
Subject: Re: GSoC proposal: Fast GiST index build
Date: 2011-04-04 16:00:14
Message-ID: 818.1301932814@sss.pgh.pa.us (view raw or flat)
Thread:
Lists: pgsql-hackers
Robert Haas <robertmhaas(at)gmail(dot)com> writes:
> On Mon, Apr 4, 2011 at 7:16 AM, Alexander Korotkov <aekorotkov(at)gmail(dot)com> wrote:
>> Project name
>> Fast GiST index build

> Would/could/should this be implemented in a manner similar to the
> existing "GIN fast update" feature?

Fast build and fast update tend to be two different problems ...

> It's occurred to me to wonder whether even btree indexes would benefit
> from this type of optimization.

GIN fast update is a win when you can optimize the insertion of multiple
occurrences of the same key.  There isn't really any corresponding
optimization possible in btree, AFAICS.  (Heikki did some work awhile
back on btrees with multiple TIDs per key, for low-cardinality tables,
which might conceivably admit of a similar optimization.  But I haven't
heard anything about that in a long time.  It wasn't real clear to me
where the win over GIN would be for that.)

			regards, tom lane

In response to

pgsql-hackers by date

Next:From: Dave PageDate: 2011-04-04 16:01:32
Subject: Re: time table for beta1
Previous:From: Kevin GrittnerDate: 2011-04-04 15:58:42
Subject: Re: time table for beta1

Privacy Policy | About PostgreSQL
Copyright © 1996-2014 The PostgreSQL Global Development Group