A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , mâˆ’ 1} is called a perfect hash function (PHF) for a subset S âŠ† U of size n â‰¤ m if h is 1â€“1 on S.â€¦ (More)

A perfect hash function (PHF) h : U â†’ [0, m âˆ’ 1] for a key set S is a function that maps the keys of S to unique values. The minimum amount of space to represent a PHF for a given set S is known toâ€¦ (More)

We present a simple and efficient external perfect hashing scheme (referred to as EPH algorithm) for very large static key sets. We use a number of techniques from the literature to obtain a novelâ€¦ (More)

We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluation of h(x) requiresâ€¦ (More)

A hash function is a mapping from a key universe U to a range of integers, i.e., h : U/f0;1, . . . ,m 1g, where m is the rangeâ€™s size. A perfect hash function for some set SDU is a hash function thatâ€¦ (More)

Sanitization is the process of securely erasing sensitive data from a storage system, effectively restoring the system to a state as if the sensitive data had never been stored. Depending on theâ€¦ (More)

A perfect hash function (PHF) is an injective function that m ps keys from a setS to unique values. Since no collisions occur, each key can be r etrieved from a hash table with a single probe. Aâ€¦ (More)

We show that the threshold cr,k for appearance of a k-core in a randomr-partiter-uniform hypergraphGr,n,m is the same as for a randomr-uniform hypergraph withcn/r edges without ther-partiteâ€¦ (More)

Most storage systems that write in a log-structured manner need a mechanism for garbage collection (GC), reclaiming and consolidating space by identifying unused areas on disk. In a deduplicatingâ€¦ (More)