jermp / interpolative_codingLinks
A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
☆30Updated 2 years ago
Alternatives and similar repositories for interpolative_coding
Users that are interested in interpolative_coding are comparing it to the libraries listed below
Sorting:
- Succinct data structures in C/C++☆88Updated 10 months ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- High-performance dictionary coding☆104Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆157Updated 7 months ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆32Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- ☆39Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- String Matching Algorithms Research Tool☆104Updated last year
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- haesni is a small hash function using aes-ni for fast string hashing☆19Updated 6 years ago
- For details, see the blog post:☆32Updated last year