hash, displace, and compress - sourceforge.pdfVIP

Hash, displace, and compress 1 ⋆ 2 ⋆⋆ 3 Djamal Belazzougui , Fabiano C. Botelho , and Martin Dietzfelbinger 1 Ecole Nationale Sup´erieure d’Informatique, ENI Oued Smar, Algiers, Algeria d belazzougui@ini.dz 2 Department of Computer Engineering, Federal Center for Technological Education of Minas Gerais, Belo Horizonte, Brazil fabiano@decom.cefetmg.br 3 Faculty of Computer Science and Automation, Technische Universit¨at Ilmenau, P.O.Box 100565, 98684 Ilmenau, Germany martin.dietzfelbinger@tu-ilmenau.de Abstract. A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ≤ m if h is 1–1 on S . The important performance parameters of a PHF are representation size, evaluation time and construction time. In this paper, we present an algorithm that permits to obtain PHFs with representation size very close to optimal while retaining O(n) construction time and O(1) evaluation time. For example in the case m = 2n we obtain a PHF that uses space 0.67 bits per key, and for m = 1.23n we obtain space 1.4 bits per key, which was not achievable with previously known methods. Our algorithm is inspired by several known algorithms; the main new feature is that we combine a modification of Pagh’s “hash-and-displace” approach with data com- pression on a sequence of hash function indices. That combination makes it possible to significantly reduce space usage while retaining linear con- struction tim