ot / succinctLinks
A collection of succinct data structures
☆209Updated 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☆128Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Dynamic succinct/compressed data structures☆110Updated last year
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Succinct Data Structure Library☆107Updated 12 years ago
- High-performance dictionary coding☆106Updated 8 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 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
- An efficient trie implementation.☆255Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Succinct Data Structure Library 3.0☆95Updated last month
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 8 months ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Diskbased (persistent) hashtable☆164Updated last year
- Succinct data structures in C/C++☆88Updated 11 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- a quotient filter written in C☆86Updated 8 years ago