From: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
---|---|
To: | Edmund Mergl <E(dot)Mergl(at)bawue(dot)de> |
Cc: | PostgreSQL Hackers Mailinglist <pgsql-hackers(at)postgreSQL(dot)org> |
Subject: | Re: [HACKERS] strange behavior of UPDATE |
Date: | 1999-05-25 00:20:04 |
Message-ID: | 1649.927591604@sss.pgh.pa.us |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
Edmund Mergl <E(dot)Mergl(at)bawue(dot)de> writes:
> The table is filled with 1.000.000 rows of random data
> and on every field an index is created.
BTW, do you happen to know just how random the data actually is?
I noticed that the update query
update bench set k500k = k500k + 1 where k100 = 30;
updates 10,000 rows. If this "random" data actually consists of
10,000 repetitions of only 100 distinct values in every column,
then a possible explanation for the problem would be that our
btree index code isn't very fast when there are large numbers of
identical keys. (Mind you, I have no idea if that's true or not,
I'm just trying to think of likely trouble spots. Anyone know
btree well enough to say whether that is likely to be a problem?)
regards, tom lane
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 1999-05-25 00:26:53 | Re: [HACKERS] Updated 6.5 HISTORY |
Previous Message | Edmund Mergl | 1999-05-24 22:13:33 | Re: [HACKERS] strange behavior of UPDATE |