efficient / rankselect
Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
☆54Updated last year
Alternatives and similar repositories for rankselect:
Users that are interested in rankselect are comparing it to the libraries listed below
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 10 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆116Updated 8 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- ☆26Updated 8 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 11 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Fast decoder for VByte-compressed integers☆122Updated 10 months ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- bit & sketches data structures☆60Updated 6 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- a quotient filter written in C☆84Updated 7 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- A collection of succinct data structures☆201Updated last year
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago