Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

How to Hash a Set

Version 1 : Received: 31 October 2017 / Approved: 31 October 2017 / Online: 31 October 2017 (04:35:55 CET)

How to cite: O'Keefe, R. How to Hash a Set. Preprints 2017, 2017100192. O'Keefe, R. How to Hash a Set. Preprints 2017, 2017100192.


Hash tables are widely used. They rely on good quality hash functions. Popular data structure libraries either provide no hash functions or weak hash functions for sets or maps, making it impossible or impractical to use them as keys in other tables. This article presents three algorithms for hashing a set, two of which are simple to implement, practically fast, and can be combined. The quality evaluations follow the method of [1, chapter 2]. The insight that we are looking for commutative semigroups suggests that even better methods than symmetric polynomials may be found.


set; hash table; hash function; commutative semigroup


Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.