tudocomp / compact_sparse_hashLinks
A blend of the compact and sparse hash table implementations.
☆15Updated 4 years ago
Alternatives and similar repositories for compact_sparse_hash
Users that are interested in compact_sparse_hash are comparing it to the libraries listed below
Sorting:
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 5 months ago
- Learned Monotone Minimal Perfect Hashing☆28Updated 6 months ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆38Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- Vectorized version of the PCG random number generator☆83Updated 6 months ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆237Updated last week
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Updated 2 years 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
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 11 years ago
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago