Journal ArticleDOI
A scheme for constructing ordered minimal perfect hashing functions
Reads0
Chats0
TLDR
A method to be used for the organization and retrieving data and another minimal perfect hashing scheme based upon number theory, with the function h(k) = [CT(k)] mod n.About:
This article is published in Information Sciences.The article was published on 1986-09-01. It has received 7 citations till now. The article focuses on the topics: Dynamic perfect hashing & K-independent hashing.read more
Citations
More filters
GPERF: A Perfect Hash Function Generator.
TL;DR: A static search set is an abstract data type (ADT) with operations initialize, insert, and retrieve with typical static search sets include compiler and interpreter reserved words, assembler instruction mnemonics, shell interpreter built-in commands, and CORBA IDL compilers.
Book
GPERF: a perfect hash function generator
TL;DR: Gperf as mentioned in this paper is a C++ perfect hash function generator for keyword recognition that 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.
Journal Article
Perfect hashing schemes for mining traversal patterns
TL;DR: This paper proposes perfect hashing schemes for mining traversal patterns to avoid collisions in the hash table by employing a delicate encoding scheme and shows that the experimental results show the method is more than twice as faster than FS algorithm and is scalable to database sizes.
Journal ArticleDOI
Empirical studies of some hashing functions
TL;DR: The major finding is that the performance of these functions with the Nigerian names is comparable to those for the other data sets, and the superiority of the random and division methods over others is confirmed, even though the division method will often be preferred for its ease of computation.
Proceedings ArticleDOI
Research on hash algorithm for retrieval of global multi-resolution terrain cache data
Wang Jian-po,Yue Liqun,Xia Qing +2 more
TL;DR: A hash indexing algorithm adapted to terrain data block cache is presented, and the design of keyword and the solution of collision are discussed, suggesting that this hash indexer has low collision and can retrieve cache data fleetly and efficiently.
References
More filters
Book
Sorting and Searching
TL;DR: The first revision of this third volume is a survey of classical computer techniques for sorting and searching that extends the treatment of data structures to consider both large and small databases and internal and external memories.
Journal ArticleDOI
Addressing for random-access storage
TL;DR: Estimates are made of the amount of searching required for the exact location of a record in several types of storage systems, including the index-table method of addressing and the sorted-file method.
Journal ArticleDOI
Scatter storage techniques
TL;DR: L'article donne une presentation didactique sur les methodes connues utilisees par ceux qui ecrivent les assembleurs and compilateurs de maniere a reduire les temps de recherche dans les tables de symboles.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Minimal perfect hash functions made simple
TL;DR: In this article, a method for computing machine independent, minimal perfect hash functions of the form: hash value ← key length + the associated value of the key's first character + the corresponding value of a key's last character is presented.