ot / succinctLinks
A collection of succinct data structures
☆211Updated 2 years ago
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☆129Updated 11 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated 2 weeks ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Succinct Data Structure Library☆109Updated 12 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- qp tries and crit-bit tries☆122Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆131Updated 2 years ago
- An efficient trie implementation.☆255Updated 5 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- Succinct Data Structure Library 3.0☆100Updated 3 weeks ago
- Succinct data structures in C/C++☆92Updated last year
- Fast decoder for VByte-compressed integers☆125Updated last month
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- a quotient filter written in C☆88Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Diskbased (persistent) hashtable☆166Updated last year
- C library to compute the Hamming weight of arrays☆51Updated 7 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
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 2 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 11 months ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago