Hi Thomas,

>feeling lucky today ? <bg>
>...is guaranteed to be faster than Two-Step-Dance-Routine, but what happens in case of hash collisions due to imperfect hash functions / not enough key size ?
>I spent some time checking out duplicate frequency cut off points to get the best strategy for hash collision treatment and you optimize it away<g>.

I checked the records in the resulting Table2.dbf. They are absolutely identical to the records our former UNIQUE index found. So, at least with these data, the MD5 hash does what I expect it to do.

I assumed that the MD5 routine will return exactly the same hash on other people's machines. Is this not guaranteed?

BTW, I'm aware that this is not sufficient in general. But in this special case...

Markus