Fast and scalable minimal perfect hashing for massive key sets

DOI10.4230/LIPICS.SEA.2017.25zbMATH Open1433.68104arXiv1702.03154MaRDI QIDQ4580182FDOQ4580182

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

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

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)

Cited In (8)

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

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)