Results 1  10
of
322
A faster algorithm for constructing minimal perfect hash functions
 In Proceedings of the Fifteenth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Data Structures
, 1992
"... Our previous research on oneprobe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this problem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space is v ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
Our previous research on oneprobe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this problem. Here, a new algorithm is described for quickly finding minimal perfect hash functions whose specification space
FINDING MINIMAL PERFECT HASH
, 1986
"... A heurisitic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction of this f ..."
Abstract
 Add to MetaCart
A heurisitic is given for finding minimal perfect hash functions without extensive searching. The procedure is to construct a set of graph (or hypergraph) models for the dictionary, then choose one of the models for use in constructing the minimal perfect hashing function. The construction
Generating Minimal Perfect Hash Functions
 in O(M ) time, Archiwum Inform. Teoret. i Stos
, 1992
"... The randomized, deterministic and parallel algorithms for generating minimal perfect hash functions (MPHF) are proposed. Given a set of keys, W , which are character strings over some alphabet, the algorithms using a threestep approach (mapping, ordering, searching) find the MPHF of the form h(w) ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The randomized, deterministic and parallel algorithms for generating minimal perfect hash functions (MPHF) are proposed. Given a set of keys, W , which are character strings over some alphabet, the algorithms using a threestep approach (mapping, ordering, searching) find the MPHF of the form h
An Optimal Algorithm for Generating Minimal Perfect Hash Functions,”
 Information Processing Letters,
, 1992
"... Abstract Czech, Z.J., G. Havas and B.S. Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters 43 (1992) 257264. A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic, involv ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
Abstract Czech, Z.J., G. Havas and B.S. Majewski, An optimal algorithm for generating minimal perfect hash functions, Information Processing Letters 43 (1992) 257264. A new algorithm for generating order preserving minimal perfect hash functions is presented. The algorithm is probabilistic
Simple and spaceefficient minimal perfect hash functions
 In Proc. of the 10th Intl. Workshop on Data Structures and Algorithms
, 2007
"... Abstract. 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 be approximately 1.44n 2 /m bits, where n = S. In this paper we present new algorithms for ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
Abstract. 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 be approximately 1.44n 2 /m bits, where n = S. In this paper we present new algorithms
A New Algorithm for Constructing Minimal Perfect Hash Functions
"... 1 Introduction Let S be a set of n distinct keys belonging to a finiteuniverse U of keys. The keys in S are stored so thatmembership queries asking if key ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
1 Introduction Let S be a set of n distinct keys belonging to a finiteuniverse U of keys. The keys in S are stored so thatmembership queries asking if key
Perfect Hashing for Network Applications
, 2006
"... Hash tables are a fundamental data structure in many network applications, including route lookups, packet classification and monitoring. Often a part of the data path, they need to operate at wirespeed. However, several associative memory accesses are needed to resolve collisions, making them slow ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
to implement in hardware. This paper introduces a hardwarefriendly scheme for minimal perfect hashing, with space requirement approaching 3.7 times the information theoretic lower bound. Our construction is several orders faster than existing perfect hashing schemes. Instead of using the traditional mapping
A practical minimal perfect hashing method
 In Proc. of the 4th International Workshop on Efficient and Experimental Algorithms (WEA’05
, 2005
"... Abstract. 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 two memory accesses for any key x and the description of h takes up 1.15n words. This impro ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
Abstract. 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 two memory accesses for any key x and the description of h takes up 1.15n words
Graph with Minimal Perfect Hash Functions
, 2013
"... It is not easy to find the number of selfavoiding walks from (0,0) to (n,n), because the number increases rapidly with the increase of n and mathematical formula for calculating it is not known. Our challenge is to develop advanced algorithmic techniques through efforts of finding the answer to the ..."
Abstract
 Add to MetaCart
to the larger n. The idea of Knuth’s algorithm is so effective that it can compute the answer to n = 11 in a second and n = 21 in a few days, even though it is designed for general graphs. In this paper, we specialize it in grid graphs and maximize space and time efficiency. Our program have successfully
External perfect hashing for very large key sets
, 2008
"... A perfect hash function (PHF) h: S → [0, m − 1] for a key set S ⊆ U of size n, where m ≥ n and U is a key universe, is an injective function that maps the keys of S to unique values. A minimal perfect hash function (MPHF) is a PHF with m = n, the smallest possible range. Minimal perfect hash functio ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
A perfect hash function (PHF) h: S → [0, m − 1] for a key set S ⊆ U of size n, where m ≥ n and U is a key universe, is an injective function that maps the keys of S to unique values. A minimal perfect hash function (MPHF) is a PHF with m = n, the smallest possible range. Minimal perfect hash
Results 1  10
of
322