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
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated last month
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆54Updated 5 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆49Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Vectorized version of the PCG random number generator☆80Updated 4 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- A benchmark for sorting algorithms☆61Updated 4 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)☆54Updated 7 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago