ot / succinctLinks
A collection of succinct data structures
☆207Updated last year
Alternatives and similar repositories for succinct
Users that are interested in succinct are comparing it to the libraries listed below
Sorting:
- Compact Data Structures Library☆101Updated 3 years ago
- Compact Data Structures Library☆128Updated 10 years ago
- 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
- High-performance dictionary coding☆104Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Succinct Data Structure Library☆107Updated 11 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Succinct data structures in C/C++☆88Updated 10 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 6 months ago
- A library of inverted index data structures☆150Updated 2 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 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
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- a quotient filter written in C☆86Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Diskbased (persistent) hashtable☆164Updated 10 months ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Updated 12 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 7 months ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago