Premium
A letter‐oriented perfect hashing scheme based upon sparse table compression
Author(s) -
Chang ChinChen,
Wu TzongChen
Publication year - 1991
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380210104
Subject(s) - computer science , table (database) , hash table , scheme (mathematics) , compression (physics) , dynamic perfect hashing , hash function , linear hashing , perfect hash function , algorithm , arithmetic , theoretical computer science , mathematics , database , double hashing , computer security , materials science , composite material , mathematical analysis
In this paper, a new letter‐oriented perfect hashing scheme based on Ziegler's row displacement method is presented. A unique n ‐tuple from a given set of static letter‐oriented key words can be extracted by a heuristic algorithm. Then the extracted distinct n‐tuples are associated with a 0/1 sparse matrix. Using a sparse matrix compression technique, a perfect hashing function on the key words is then constructed.