Preprint Article Version 1 This version 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 (doi: 10.20944/preprints201710.0192.v1). O'Keefe, R. How to Hash a Set. Preprints 2017, 2017100192 (doi: 10.20944/preprints201710.0192.v1).

Abstract

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.

Subject Areas

set; hash table; hash function; commutative semigroup

Readers' Comments and Ratings (0)

Leave a public comment
Send a private comment to the author(s)
Rate this article
Views 0
Downloads 0
Comments 0
Metrics 0
Leave a public comment

×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.