ot / emphfLinks
An efficient external-memory algorithm for the construction of minimal perfect hash functions
☆64Updated last year
Alternatives and similar repositories for emphf
Users that are interested in emphf are comparing it to the libraries listed below
Sorting:
- Compact Data Structures Library☆101Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated last month
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Compact Data Structures Library☆128Updated 10 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Succinct Data Structure Library 3.0