ByteHamster / SicHashLinks
A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
☆20Updated this week
Alternatives and similar repositories for SicHash
Users that are interested in SicHash are comparing it to the libraries listed below
Sorting:
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 8 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Bit packed vector of integral values☆27Updated 8 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated last week
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- ✈️ PTHash is a fast and compact minimal perfect hash function.☆239Updated last week
- 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
- ☆25Updated 6 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- Dynamic succinct/compressed data structures☆110Updated last year
- ☆20Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)☆13Updated 8 years ago
- Low memory multithreaded hash table☆24Updated 10 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Succinct Data Structure Library 3.0☆95Updated last month
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- benchmarking positional population count☆15Updated last year
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 2 months ago