ot / emphfLinks
An efficient external-memory algorithm for the construction of minimal perfect hash functions
☆66Updated last year
Alternatives and similar repositories for emphf
Users that are interested in emphf are comparing it to the libraries listed below
Sorting:
- Bloom-filter based minimal perfect hash function library☆270Updated 6 months ago
- Compact Data Structures Library☆103Updated 3 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- Dynamic succinct/compressed data structures☆114Updated last month
- Compact Data Structures Library☆129Updated 11 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Succinct Data Structure Library 3.0☆101Updated last month
- 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 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…☆108Updated 11 years ago
- C library to compute the Hamming weight of arrays☆51Updated 7 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Fast decoder for VByte-compressed integers☆126Updated 2 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- FOundation of stXXl and thriLL☆14Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Rolling Hash C++ Library☆190Updated last year
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆157Updated last year
- qp tries and crit-bit tries☆123Updated 3 years ago
- Compute xxHash hash codes for 8 keys in parallel☆47Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆24Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year