efficient / rankselectLinks
Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
☆55Updated last year
Alternatives and similar repositories for rankselect
Users that are interested in rankselect are comparing it to the libraries listed below
Sorting:
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- A collection of succinct data structures☆209Updated last year
- Compact Data Structures Library☆128Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Fast decoder for VByte-compressed integers☆124Updated last year
- ☆27Updated 8 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Feed-forward Bloom filters☆53Updated 14 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
- Experiments with array layouts for comparison-based searching☆84Updated last year
- bit & sketches data structures☆60Updated 6 years ago
- High-performance dictionary coding☆105Updated 8 years ago
- Vectorized intersections (research code)☆16Updated 8 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- a quotient filter written in C☆86Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- qp tries and crit-bit tries☆121Updated 3 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- fixed-length integer trim☆34Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 7 months ago