ByteHamster / PaCHash
Packed and Compressed Hash Tables
☆15Updated last year
Alternatives and similar repositories for PaCHash:
Users that are interested in PaCHash are comparing it to the libraries listed below
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆27Updated 2 months ago
- ☆17Updated last week
- Learned Monotone Minimal Perfect Hashing☆25Updated last month
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated 2 months ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆40Updated last month
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 months ago
- Multi-platform topology-aware memory management library☆13Updated 4 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆36Updated 3 weeks ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 4 months ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- ☆15Updated 10 years ago
- ☆39Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- REplicated STORagE☆13Updated last year
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆44Updated last week
- C++17 implementation of memory-efficient dynamic tries☆58Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- ☆52Updated 8 months ago