westonpace commented on PR #13487: URL: https://github.com/apache/arrow/pull/13487#issuecomment-1189604651
> I'd add that non-random but likely selections should also show a nice hash distribution. Including: > The implementations from arrow/util/hashing.h try to satisfy those requirements, btw, so you could reuse them. It would be great, by the way, to have benchmarks of the two hashing utilities we have. I believe the utilities we have in `key_hash.h` trade off some distribution performance in favor of runtime performance when compared with the utilities in `hashing.h`. It would be nice to have some objective measures of this tradeoff. Also, can we expand in the function doc that these hashes are not suitable for cryptographic purposes? -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
