|
Dan: The point I wanted to make was that you might be perfectly happy with a simple XFOOT of an array of 32-bit integers plus a couple tweaks for transposed records, etc. Most likely that'll give as much uniqueness as you'll ever need and the whole application could be coded in a couple hours perhaps. OTOH, if Leif is willing to give more or less direct assistance in MI, then I say 'go for it!' That's worth the effort. Tom Liotta "Dan Bale" wrote > Tom, I understand that 20 bytes of hash is never going to absolutely > guarantee that two generations of the same hash value mean that the two > source members are identical. Still, 20 bytes = 16**20 = > 1,208,925,819,614,629,174,706,176 --- I think those are pretty good odds. > > Also, I had to re-read Bob Crother's original suggestion after Tom clarified > something for me. I misinterpreted the "Read the source record in as an > array of 32 bit integers." Now I'm not sure what that really means. How do > I turn a source record into an array of 32 bit integers? Would this be > "better"/more unique than the CIPHER hash that Leif's MIFHASH app will > generate? -- Tom Liotta The PowerTech Group, Inc. 19426 68th Avenue South Kent, WA 98032 Phone 253-872-7788 Fax 253-872-7904 http://www.400Security.com ___________________________________________________ The ALL NEW CS2000 from CompuServe Better! Faster! More Powerful! 250 FREE hours! Sign-on Now! http://www.compuserve.com/trycsrv/cs2000/webmail/
As an Amazon Associate we earn from qualifying purchases.
This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].
Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.