tudocomp / compact_sparse_hash
A blend of the compact and sparse hash table implementations.
☆12Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for compact_sparse_hash
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Clustered Elias-Fano inverted indexes.☆14Updated 6 years ago
- C++17 implementation of memory-efficient dynamic tries☆57Updated 2 years ago
- Vectorized intersections (research code)☆14Updated 7 years ago
- Compact Tree Representation☆16Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- A Space-Optimal Grammar Compression☆10Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated 2 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- Universe-sliced indexes in C++.☆17Updated last year
- Interleaving bits from two sources using SIMD instructions.☆14Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆23Updated 2 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- benchmarking positional population count☆11Updated 7 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆25Updated 5 years ago
- LZ Double factor Factorization.☆11Updated 7 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 5 years ago
- For details, see the blog post:☆31Updated 10 months ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆50Updated 8 months ago
- A C++ library for integer array compression☆27Updated 2 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 3 years ago