Results 151 to 160 of about 44,364 (200)
Some of the next articles are maybe not open access.
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience, 2007We describe a new practical algorithm for finding perfect hash functions with no specification space at all, suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time.
openaire +2 more sources
On the design of ordered minimal perfect hashing functions
1986 IEEE Second International Conference on Data Engineering, 1986 In 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.
Chia‐Chen Chang, Jiann‐Cherng Shieh
openalex +3 more sources
On the design of letter oriented minimal perfect hashing functions [PDF]
Journal of the Chinese Institute of Engineers, 1985 Abstract 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
Communications of the ACM, 1981
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire +3 more sources
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire +3 more sources
Direct Perfect Hashing Functions for External Files
Journal of Database Management, 1991A file organization scheme based on composite perfect hashing, which guarantees single access retrieval from external files has been proposed recently. The ideal retrieval performance is achieved by using an auxiliary internal table and direct perfect hashing.
M.V. Ramakrishna, Yuchi Bannai
openaire +2 more sources
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zbigniew J. Czech +2 more
openaire +4 more sources
A faster algorithm for constructing minimal perfect hash functions
Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92, 1992 Our previous research on one-probe 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 very close to the theoretical lower bound, i.e., around 2
Edward A. Fox +2 more
openalex +3 more sources
On the program size of perfect and universal hash functions
23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 1982We address the question of program size of of perfect and universal hash functions. We prove matching upper and lower bounds (up to constant factors) on program size. Furthermore, we show that minimum or nearly minimum size programs can be found efficiently.
openaire +1 more source
Simple and Space-Efficient Minimal Perfect Hash Functions [PDF]
, 2007 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.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 ...
Rasmus Pagh +2 more
openaire +1 more source
A scheme for constructing ordered minimal perfect hashing functions
Information Sciences, 1986This paper describes a method to be used for the organization and retrieval of data. Jaeschke proposed the function \(h(k)=\lfloor C/(Dk+E)\rfloor mod n\), where n is the size of a given key set, for constructing minimal perfect hashing functions.
openaire +2 more sources