Paper Info
Title
On the Design of Ordered Minimal Perfect Hashing Functions
Abstract
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.
Year
DOI
Venue
1986
10.1109/ICDE.1986.7266212
ICDE
Keywords
Field
DocType
ordered minimal perfect hashing,system performance,mathematics,organizations,computer aided software engineering,hash function,machinery
Reserved word,Data mining,Identifier,Computer science,Theoretical computer science,Perfect hash function,Computer-aided software engineering,Database
Conference
ISBN
Citations 
PageRank 
0-8186-0655-X
5
17.79
References 
Authors
5
2
Name
Order
Citations
PageRank
C. C. Chang14644.84
J. C. Shieh21119.68