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☆100Updated 3 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 2 weeks ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Dynamic succinct/compressed data structures☆112Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Compact Data Structures Library☆127Updated 10 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆54Updated 5 years ago
- Compact Tree Representation☆16Updated 8 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- A collection of succinct data structures☆205Updated last year
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Rolling Hash C++ Library☆187Updated last year
- Succinct data structures in C/C++☆89Updated 9 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Experiments with array layouts for comparison-based searching☆84Updated last year