jermp / s_indexesLinks
Universe-sliced indexes in C++.
☆18Updated 2 years ago
Alternatives and similar repositories for s_indexes
Users that are interested in s_indexes are comparing it to the libraries listed below
Sorting:
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Succinct data structures in C/C++☆88Updated last year
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 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
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Fast compressed trie dictionary library☆71Updated last year
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Vectorized version of the PCG random number generator☆83Updated 7 months ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- For details, see the blog post:☆34Updated last year
- qp tries and crit-bit tries☆122Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months 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
- Compact Data Structures Library☆128Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- C Minimal Perfect Hashing Library☆86Updated 8 years ago