jermp / mutable_rank_selectLinks
A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
☆35Updated 2 years ago
Alternatives and similar repositories for mutable_rank_select
Users that are interested in mutable_rank_select are comparing it to the libraries listed below
Sorting:
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 4 months ago
- Succinct data structures in C/C++☆88Updated 10 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.