vigna / suxLinks
Succinct data structures in C/C++
☆88Updated last year
Alternatives and similar repositories for sux
Users that are interested in sux are comparing it to the libraries listed below
Sorting:
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆50Updated 4 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆286Updated last month
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- ☆110Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- A collection of succinct data structures☆210Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 6 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆241Updated last week
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Vectorized version of the PCG random number generator☆83Updated 7 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- For details, see the blog post:☆34Updated last year