Results 171 to 180 of about 118,403 (212)
Some of the next articles are maybe not open access.
On the design of ordered minimal perfect hashing functions
1986 IEEE Second International Conference on Data Engineering, 1986In this paper, we shall give an ordered minimal perfect hashing scheme for letter oriented keys. We applied our method successfully to four practical key sets like the set of animals' identifiers in English, the set of C's keywords, the set of frequently occurring English words and the set of PASCAL'S reserved words.
C. C. Chang, J. C. Shieh
openaire +1 more source
Implementation of a Perfect Hash Function Scheme [PDF]
, 2013 This report surveys the recent development in computing perfect hash functions, and in particular, closely examines an algorithm proposed by Thomas Sager. An implementation of that algorithm in C has been done to demonstrate and verify the behavior of the algorithm for various settings of parameters.
Datta, Sanjeev, Fox, Edward A.
openaire
Lexicon design using perfect hash functions
ACM SIGSOC Bulletin, 1981The research reported in this paper derives from the recent algorithm of Cichelli (1980) for computing machine-independent, minimal perfect hash functions of the form:hash value: hash key length + associated value of the key's first letter + associated value of the key's last letterA minimal perfect hash function is one which provides single probe ...
Nick Cercone, Max Krause, John Boates
openaire +1 more source
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
Embedded Systems and ApplicationsA minimal perfect hash function (MPHF) maps a set of n keys to {1, ..., n} without collisions. Such functions find widespread application e.g. in bioinformatics and databases.
Stefan Hermann +4 more
semanticscholar +1 more source
Simplified Tight Bounds for Monotone Minimal Perfect Hashing
Annual Symposium on Combinatorial Pattern MatchingGiven an increasing sequence of integers $x_1,\ldots,x_n$ from a universe $\{0,\ldots,u-1\}$, the monotone minimal perfect hash function (MMPHF) for this sequence is a data structure that answers the following rank queries: $rank(x) = i$ if $x = x_i ...
Dmitry Kosolobov
semanticscholar +1 more source
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Czech, Zbigniew J. +2 more
openaire +3 more sources
On the design of letter oriented minimal perfect hashing functions
Journal of the Chinese Institute of Engineers, 1985Abstract In this paper, the progress made in the area of designing minimal perfect hashing functions is reviewed. This paper points out that all minimal perfect hashing functions have one common disadvantage: They are only suitable for small key sets. Moreover, a new hashing scheme is proposed.
Chin‐Chen Chang, Jiann‐Cherng Shieh
openaire +1 more source
Simple and Space-Efficient Minimal Perfect Hash Functions
2007A 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.44n2/m bits, where n = |S|. In this paper we present new algorithms for construction and evaluation of PHFs of a given set (for m = n and ...
Fabiano C. Botelho +2 more
openaire +1 more source
Construct a perfect word hash function in time independent of the size of integers
Information Processing Letters, 2017Yijie Han
semanticscholar +1 more source