Fast and scalable minimal perfect hashing for massive key sets

DOI10.4230/LIPICS.SEA.2017.25MaRDI QIDQ4580182zbMATH OpenFDO

Authors Antoine Limasset, Guillaume Rizk, Rayan Chikhi, Pierre Peterlongo

Publication date 13 August 2018

Full work available at URL https://arxiv.org/abs/1702.03154

zbMATH Keywords

algorithmsbig datadata structuresminimal perfect hash functions

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms (68W40) Data structures (68P05)

Recommendations

• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 88958
• Simple and Space-Efficient Minimal Perfect Hash Functions
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• scientific article; zbMATH DE number 1875411

Cited in

(8)

• scientific article; zbMATH DE number 88958 (Why is no real title available?)
• A tale of optimizing the space taken by de Bruijn graphs
• Fast scalable construction of ([compressed] static | minimal perfect hash) functions
• Fingerprinting-based minimal perfect hashing revisited
• A resource-frugal probabilistic dictionary and applications in bioinformatics
• Fast and simple compact hashing via bucketing
• Secure two-party input-size reduction: challenges, solutions and applications
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Fast and scalable minimal perfect hashing for massive key sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580182)