Re: Why creating GIN table index is so slow than inserting data into empty table with the same index?

Список
Период
Сортировка
От Tom Lane
Тема Re: Why creating GIN table index is so slow than inserting data into empty table with the same index?
Дата
Msg-id 26264.1237902313@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: Why creating GIN table index is so slow than inserting data into empty table with the same index?  (Heikki Linnakangas)
Список pgsql-performance
Heikki Linnakangas <> writes:
> Tom Lane wrote:
>> I think a reasonable solution for this might be to keep an eye on
>> maxdepth and force a flush if that gets too large (more than a few
>> hundred, perhaps?).  Something like this:

> I fooled around with a balanced tree, which solved the problem but
> unfortunately made the unsorted case slower.

Yeah, rebalancing the search tree would fix that, but every balanced
tree algorithm I know about is complicated, slow, and needs extra
memory.  It's really unclear that it'd be worth the trouble for a
transient data structure like this one.

            regards, tom lane

В списке pgsql-performance по дате отправления:

Предыдущее
От: Greg Smith
Дата:
Сообщение: Re: High CPU Utilization
Следующее
От: Scott Marlowe
Дата:
Сообщение: Re: High CPU Utilization