On 16/07/12 20:08, Claudio Freire wrote:
> On Mon, Jul 16, 2012 at 3:59 PM, Mark Thornton <mthornton(at)optrak(dot)com> wrote:
>> 4. The most efficient way for the database itself to do the updates would be
>> to first insert all the data in the table, and then update each index in
>> turn having first sorted the inserted keys in the appropriate order for that
> Actually, it should create a temporary index btree and merge them.
> Only worth if there are really a lot of rows.
>  http://www.ccs.neu.edu/home/bradrui/index_files/parareorg.pdf
I think 93 million would qualify as a lot of rows. However does any
available database (commercial or open source) use this optimisation.
In response to
pgsql-performance by date
|Next:||From: Tom Lane||Date: 2012-07-16 19:18:53|
|Subject: Re: [PERFORM] DELETE vs TRUNCATE explanation|
|Previous:||From: Claudio Freire||Date: 2012-07-16 19:08:14|
|Subject: Re: very very slow inserts into very large table|