ByteHamster / PaCHash
Packed and Compressed Hash Tables
☆15Updated last year
Related projects ⓘ
Alternatives and complementary repositories for PaCHash
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated last week
- Learned Monotone Minimal Perfect Hashing☆24Updated this week
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- ☆13Updated last month
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆15Updated this week
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆14Updated this week
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 11 months ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 weeks ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆39Updated this week
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Multi-platform topology-aware memory management library☆13Updated 4 years ago
- KaMPIng: (Near) zero-overhead MPI wrapper for modern C++☆35Updated 2 weeks ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 3 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆35Updated this week
- ☆52Updated 6 months ago
- FOundation of stXXl and thriLL☆14Updated 10 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆29Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆53Updated 10 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year