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☆61Updated 5 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 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
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 4 years ago
- For details, see the blog post:☆31Updated 10 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆14Updated last month
- ☆14Updated 5 months ago
- Compact Data Structures Library☆98Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated 2 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆30Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- Linear vs binary search benchmark☆41Updated 4 years ago
- ☆20Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- A benchmark of some prominent C/C++ hash table implementations☆103Updated 5 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆125Updated last year
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- Bit packed vector of integral values☆26Updated last year
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆28Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆49Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- An encoder/decoder collection for a sequence of integers☆32Updated 11 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆28Updated 5 months ago
- std::map/std::set implementation using the adaptive radix tree☆13Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Universe-sliced indexes in C++.☆17Updated last year