ot / succinct
A collection of succinct data structures
☆201Updated last year
Alternatives and similar repositories for succinct:
Users that are interested in succinct are comparing it to the libraries listed below
- Compact Data Structures Library☆124Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Compact Data Structures Library☆98Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated 10 months ago
- A library of inverted index data structures☆148Updated 2 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆82Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- Succinct Data Structure Library 3.0☆94Updated 6 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 9 months ago
- High-performance dictionary coding☆104Updated 7 years ago
- Fast decoder for VByte-compressed integers☆122Updated 10 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- Succinct data structures in C/C++☆87Updated 5 months ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Bloom-filter based minimal perfect hash function library☆254Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆136Updated 2 months ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- A fast alternative to the modulo reduction☆309Updated 4 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆205Updated 4 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆429Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆105Updated 10 years ago
- a quotient filter written in C☆84Updated 7 years ago