Results 1  10
of
43,331
Quasiperfect Hashing
"... The idea of quasiperfect hashing is introduced and applied to solve the static dictionary problem. Given a universe U and a set S of n distinct keys belonging to U, we propose a quasiperfect hash function which allows one to find a key from S, stored in the hash table of size m, m ≥ n, in O(1) tim ..."
Abstract
 Add to MetaCart
The idea of quasiperfect hashing is introduced and applied to solve the static dictionary problem. Given a universe U and a set S of n distinct keys belonging to U, we propose a quasiperfect hash function which allows one to find a key from S, stored in the hash table of size m, m ≥ n, in O(1
On the Circuit Complexity of Perfect Hashing
"... Abstract. We consider the size of circuits that perfectly hash an arbitrary subset S ⊂{0, 1} n of cardinality 2 k into {0, 1} m. We observe that, in general, the size of such circuits is exponential in 2k −m, and provide a matching upper bound. ..."
Abstract
 Add to MetaCart
Abstract. We consider the size of circuits that perfectly hash an arbitrary subset S ⊂{0, 1} n of cardinality 2 k into {0, 1} m. We observe that, in general, the size of such circuits is exponential in 2k −m, and provide a matching upper bound.
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 15 (1 self)
 Add to MetaCart
slower than required. This motivates us to consider minimal perfect hashing schemes, which reduce the number of memory accesses to just 1 and are also spaceefficient. Existing perfect hashing algorithms are not tailored for network applications because they take too long to construct and are hard
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
A Perfect Hash Function Generator
"... gperf is a "softwaretool generatingtool" designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and objectoriented design and implementation strategies incorporated in gperf.Italso presents the results from an empirical comparison ..."
Abstract

Cited by 56 (36 self)
 Add to MetaCart
gperf is a "softwaretool generatingtool" designed to automate the generation of perfect hash functions. This paper describes the features, algorithms, and objectoriented design and implementation strategies incorporated in gperf.Italso presents the results from an empirical comparison
Explicit Constructions for Perfect Hash Families
"... Let k, v, t be integers such that k ≥ v ≥ t ≥ 2. A perfect hash family PHF(N; k, v, t) can be defined as an N × k array with entries from a set of v symbols such that every N × t subarray contains at least one row having distinct symbols. Perfect hash families have been studied by over 20 years and ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let k, v, t be integers such that k ≥ v ≥ t ≥ 2. A perfect hash family PHF(N; k, v, t) can be defined as an N × k array with entries from a set of v symbols such that every N × t subarray contains at least one row having distinct symbols. Perfect hash families have been studied by over 20 years
Blooming trees for minimal perfect hashing
 in Proceedings of the Global Communications Conference (GLOBECOM). IEEE, Nov 2008
"... Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suitable for fast operations. Therefore, perfect hash functions have been introduced to make the hashing mechanism more effici ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suitable for fast operations. Therefore, perfect hash functions have been introduced to make the hashing mechanism more
Perfect Hash Families with Few Functions
, 2000
"... An (s; n; q; t)perfect hash family is a set of functions OE 1 ; OE 2 ; : : : ; OE s from a set V of cardinality n to a set F of cardinality q with the property that every tsubset of V is injectively mapped into F by at least one of the functions OE i . ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
An (s; n; q; t)perfect hash family is a set of functions OE 1 ; OE 2 ; : : : ; OE s from a set V of cardinality n to a set F of cardinality q with the property that every tsubset of V is injectively mapped into F by at least one of the functions OE i .
A Practical Perfect Hashing Algorithm
, 1998
"... Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constanttime lookup, has particular theoretical and practical importance. The algorithm of Fredman, Koml'os, and Szemer'edi [8], augmented by Dietzfelbinger, et al. [7], is a simple perfect ha ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constanttime lookup, has particular theoretical and practical importance. The algorithm of Fredman, Koml'os, and Szemer'edi [8], augmented by Dietzfelbinger, et al. [7], is a simple perfect
Results 1  10
of
43,331