Re: cyclical redundancy checksum algorithm(s)? - Mailing list pgsql-general

From Ron Johnson
Subject Re: cyclical redundancy checksum algorithm(s)?
Date
Msg-id 451AEC54.8040501@cox.net
Whole thread Raw
In response to Re: cyclical redundancy checksum algorithm(s)?  ("Karen Hill" <karen_hill22@yahoo.com>)
List pgsql-general
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

On 09/27/06 16:02, Karen Hill wrote:
> Gene Wirchenko wrote:
[snip]
>>> Yet what happens if there is a collision of the checksum for a row?
>>      Then you get told that no change has occurred when one has.  I
>> would call this an error.
>
> That's exactly what I thought when I read that in his book.  I was
> thinking back to the sha1 and md5 algorithms, maybe a special crc
> algorithm is safe from this.

I doubt it.  The typical CRC is 32 bits, whereas the MD5 hash is 128
bits and SHA1 is 160 bits.

- --
Ron Johnson, Jr.
Jefferson LA  USA

Is "common sense" really valid?
For example, it is "common sense" to white-power racists that
whites are superior to blacks, and that those with brown skins
are mud people.
However, that "common sense" is obviously wrong.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)

iD4DBQFFGuxUS9HxQb37XmcRAr0GAJ0d6r4C7Zt2tug/AHH/aCPG5p8UMgCY8bDU
MgTQuPe9uNT5Ny3nW0qk6w==
=o//D
-----END PGP SIGNATURE-----

pgsql-general by date:

Previous
From: Tom Lane
Date:
Subject: Re: change the order of FROM selection to make query work
Next
From: Jeff Davis
Date:
Subject: 'pg_ctl -w' times out when unix_socket_directory is set