Results 11 to 20 of about 76,072 (189)
Practical minimal perfect hash functions for large databases [PDF]
Communications of the ACM, 1992 We describe the first practical algorithms for finding minimal perfect hash functions that have been used to access very large databases (i.e., having over 1 million keys). This method extends earlier work wherein an 0(n-cubed) algorithm was devised, building upon prior work by Sager that described an 0(n-to the fourth) algorithm.
Edward A. Fox +3 more
+5 more sources
A letter oriented minimal perfect hashing function [PDF]
ACM SIGPLAN Notices, 1982 Cichelli has presented a simple method for constructing minimal perfect hash tables of identifiers for small static word sets. The hash function value for a word is computed as the sum of the length of the word and the values associated with the first and last letters of the word.
Curtis R. Cook, R. R. Oldehoeft
openalex +2 more sources
Perfect hashing functions [PDF]
Communications of the ACM, 1977 A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered. Given a set I of identifiers, two methods are presented for building, in a mechanical way, perfect hashing functions, i.e. functions transforming the elements of I into unique addresses.
Renzo Sprugnoli
openalex +3 more sources
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
BRICS Report Series, 1999 A new way of constructing (minimal) perfect hash functions is described. The<br />technique considerably reduces the overhead associated with resolving buckets in two-level hashing schemes. Evaluating a hash function requires just one multiplication and a few additions apart from primitive bit operations.
Rasmus Pagh
openalex +3 more sources
Balanced Families of Perfect Hash Functions and Their Applications [PDF]
ACM Transactions on Algorithms, 2008 The construction of perfect hash functions is a well-studied topic. In this article, this concept is generalized with the following definition. We say that a family of functions from [ n ] to [ k ] is a δ-balanced ( n,k )-family of perfect hash functions if for every
Noga Alon, Shai Gutner
openalex +5 more sources
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions [PDF]
The Computer Journal, 1993 Summary: A new algorithm for finding minimal perfect hash functions (MPHF) is proposed. The algorithm given three pseudorandom functions \(h_ 0\), \(h_ 1\) and \(h_ 2\), searches for a function \(g\) such that \(F(w)=(h_ 0(w)+g(h_ 1(w))+g(h_ 2(w))) \bmod m\) is a MPHF, where \(m\) is a number of input words.
Zbigniew J. Czech
openalex +2 more sources
ENGINEERING COMPRESSED STATIC FUNCTIONS AND MINIMAL PERFECT HASH FUNCTIONS
, 2018 \emph{Static functions} are data structures meant to store arbitrary mappings from finite sets to integers; that is, given universe of items $U$, a set of $n \in \mathbb{N}$ pairs $(k_i,v_i)$ where $k_i \in S \subset U, |S|=n$, and $v_i \in \{0, 1, \ldots, m-1\} , m \in \mathbb{N} $, a static function will retrieve $v_i$ given $k_i$ (usually, in ...
Marco Genuzio
openalex +4 more sources
An informal analysis of perfect hash function search
Applied Mathematics Letters, 1989 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. Cercone, M. Krause
semanticscholar +2 more sources
GPERF: A Perfect Hash Function Generator.
, 1990 gperf is a widely available perfect hash function generator written in C++. It automates a common system software operation: keyword recognition. gperf translates an n element user-specified keyword list keyfile into source code containing a k element lookup table and a pair of functions, phash and in_word_set.
Douglas C. Schmidt
openalex +3 more sources
A polynomial time generator for minimal perfect hash functions [PDF]
CACM, 1985 Thomas J. Sager
openalex +2 more sources