splatlab / rankselect
Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
☆15Updated 6 years ago
Alternatives and similar repositories for rankselect
Users that are interested in rankselect are comparing it to the libraries listed below
Sorting:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 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 small DFA for under 16 states☆51Updated 6 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
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Compact Data Structures Library☆126Updated 10 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.☆37Updated 4 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- ☆26Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- fixed-length integer trim☆34Updated 2 years ago
- A C++ template library for compact Hamming distance indexes☆10Updated 8 years ago
- Compact tries for fixed-width keys☆25Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 4 years ago
- A Go library for succinct partial sums data structure☆10Updated 10 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆53Updated 7 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- ☆24Updated 10 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Fast 64 bit evolved hash.☆32Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago