rchikhi / benchmphf
Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)
☆13Updated 7 years ago
Related projects ⓘ
Alternatives and complementary repositories for benchmphf
- Compact Tree Representation☆16Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆31Updated last year
- std::map/std::set implementation using the adaptive radix tree☆13Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Implemented Concurrent Priority Queues using fine grained locking over sequential heap and lockfree skiplist-based☆8Updated 6 years ago
- Bit packed vector of integral values☆26Updated last year
- Compact Data Structures Library☆98Updated 2 years ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆15Updated last week
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆28Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- ☆15Updated 5 months ago
- For details, see the blog post:☆31Updated 11 months ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆30Updated 8 months ago
- Parallel Lightweight Suffix Array Algorithm.☆17Updated 7 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆47Updated 3 months ago
- benchmarking positional population count☆12Updated 8 months ago
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- Succinct Data Structure Library☆105Updated 11 years ago
- C++ implementation of Concise and WAH compressed bitsets☆21Updated 7 years ago