ot / succinctLinks
A collection of succinct data structures
☆204Updated 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☆100Updated 3 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Succinct Data Structure Library☆106Updated 11 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Fast decoder for VByte-compressed integers☆123Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- qp tries and crit-bit tries☆120Updated 3 years ago
- Succinct Data Structure Library 3.0☆94Updated 2 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- An efficient trie implementation.☆255Updated 4 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 5 months ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- Rolling Hash C++ Library☆187Updated last year
- Diskbased (persistent) hashtable☆162Updated 9 months ago
- a quotient filter written in C☆84Updated 7 years ago