Add to ORKGThis study was conducted to compare two minimal perfect hashing method Chang's method and Jaeschke's method. Since hashing is a widely used technique for store data in symbol table and the data are strings of characters, this study f use on the performance of these methods with the letter-oriented set and gives their run time performance curves. Through the analysis of run time and space complexity, an optimal method is given to make each algorithm performance well
A perfect hash function, PHF, is an injection, F, from a set, W, of M objects into the set consistin...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Hashing is so commonly used in computing that one might expect hash functions to be well understood,...
The administrative process carried out continuously produces large data. So the search process takes...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
The administrative process carried out continuously produces large data. So the search process takes...
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably r...
The administrative process carried out continuously produces large data. So the search process takes...
AbstractA brief explanation of perfect hash function search is presented followed by an informal ana...
We present a simple and efficient dictionary with worst case constant lookup time, equaling the theo...
We describe the first practical algorithm for finding minimal perfect hash functions that can be use...
Abstract. We propose a novel algorithm based on random graphs to construct minimal perfect hash func...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-nega...
Most computer programs or applications need fast data structures. The performance of a data structur...
A perfect hash function, PHF, is an injection, F, from a set, W, of M objects into the set consistin...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Hashing is so commonly used in computing that one might expect hash functions to be well understood,...
The administrative process carried out continuously produces large data. So the search process takes...
As Knuth noted, a hashing function that is one-to-one on the set of keys in the hash table is highly...
The administrative process carried out continuously produces large data. So the search process takes...
A new way of constructing (minimal) perfect hash functions is described. Thetechnique considerably r...
The administrative process carried out continuously produces large data. So the search process takes...
AbstractA brief explanation of perfect hash function search is presented followed by an informal ana...
We present a simple and efficient dictionary with worst case constant lookup time, equaling the theo...
We describe the first practical algorithm for finding minimal perfect hash functions that can be use...
Abstract. We propose a novel algorithm based on random graphs to construct minimal perfect hash func...
Hashing is a well-known and widely used technique for providing O(1) access to large files on second...
A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-nega...
Most computer programs or applications need fast data structures. The performance of a data structur...
A perfect hash function, PHF, is an injection, F, from a set, W, of M objects into the set consistin...
A concept of complexity of hashing is introduced and studied with special attention to the lower bou...
Hashing is so commonly used in computing that one might expect hash functions to be well understood,...