Paul J Stevens wrote:
- we now use the cryptographic hash only to quickly locate possibly duplicate mime-parts, If the hash doesn't occur yet, a new mimepart is stored using the hash, but generating an auto-increment bigint as it's primary key. If the hash does occur, the insertion code compares the blobs to make sure no hash collision occurs on different blobs.
Out of curiosity, what if a collision happens, how do you store the this block? "hashvalue + 1" and repeat cycle?
Regards, -- Aleksander Kamenik system administrator +372 6659 649 [EMAIL PROTECTED] Krediidiinfo AS http://www.krediidiinfo.ee/ _______________________________________________ DBmail mailing list [email protected] https://mailman.fastxs.nl/mailman/listinfo/dbmail
