Perfect hashing using sparse matrix packing
Information Systems
An optimal algorithm for generating minimal perfect hash functions
Information Processing Letters
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
The amount of memory required by perfect hash functions at retrieval time is one of the primary issues to be taken into account when looking for such functions. This correspondence gives empirical evidence about the effectiveness of a strategy suitable to significantly reduce the memory requirements of the order preserving minimal perfect hash function proposed by Czech et al. [3].