From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | Sezai YILMAZ <sezai(dot)yilmaz(at)pro-g(dot)com(dot)tr> |
Cc: | pgsql-general(at)postgresql(dot)org |
Subject: | Re: PostgreSQL insert speed tests |
Date: | 2004-02-27 17:27:50 |
Message-ID: | 20372.1077902870@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-general |
Sezai YILMAZ <sezai(dot)yilmaz(at)pro-g(dot)com(dot)tr> writes:
> I changed the three hash indexes to btree.
> The performance is increased about 2 times (in PostgreSQL 7.3.4 1905
> rows/s).
> Concurrent inserts now work.
Concurrent inserts should work with hash indexes in 7.4, though not 7.3.
The slowdown you report probably is due to the rewrite of hash indexing
to allow more concurrency --- the locking algorithm is more complex than
it used to be. I am surprised that the effect is so large though.
Could you make your test program available?
> Changed indexes are more suitable for hash type.
Are they? How many distinct values are there in those columns?
I suspect that your test may be stressing the case where only a few hash
buckets are used and each bucket chain gets to be very long.
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Stephan Szabo | 2004-02-27 17:59:37 | Re: correlated delete with 'in' and 'left outer join' |
Previous Message | Bruno Wolff III | 2004-02-27 17:23:26 | Re: compartmentalizing users |