Theory and practice of monotone minimal perfect hashing

@article{Belazzougui2008TheoryAP,
  title={Theory and practice of monotone minimal perfect hashing},
  author={Djamal Belazzougui and Paolo Boldi and Rasmus Pagh and Sebastiano Vigna},
  journal={ACM Journal of Experimental Algorithmics},
  year={2008},
  volume={16}
}
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions (Fox et al. 1991) have been used to retrieve the position of a key in a given list of keys; however, the ability to preserve any given order leads to an unavoidable Ω(n log n) lower bound on the number of bits required to store the function. Recently, it was observed (Belazzougui et al. 2009) that very frequently the keys… CONTINUE READING

References

Publications referenced by this paper.

On the size of separating systems and families of perfect hash functions

  • M. L. FREDMAN, J. KOMLÓS
  • SIAM J. Algebraic Discrete Methods
  • 1984
Highly Influential
1 Excerpt

Similar Papers

Loading similar papers…