Botelho, Fabiano C. and Galinkin, Daniel and Jr., Wagner Meira and Ziviani, Nivio (2010) Distributed perfect hashing for very large key sets. In: 3rd International ICST Conference on Scalable Information Systems.
![[thumbnail of 13336.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "13336.pdf")
PDF
13336.pdf
Download (417kB)
Abstract
A perfect hash function (PHF) h: S → [0, m -- 1] for a key set S ⊆ U of size n, where m ≥ n and U is a key universe, is an injective function that maps the keys of S to unique values. A minimal perfect hash function (MPHF) is a PHF with m = n, the smallest possible range. Minimal perfect hash functi
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 09:17 |
| Last Modified: | 18 Apr 2026 03:25 |
| URI: | http://eprints.eai.eu/id/eprint/4984 |
Actions (login required)
- View Item