roberto-trani / mphf_benchmark
A Benchmark of Minimal Perfect Hash Function Algorithms.
β35Updated 2 years ago
Alternatives and similar repositories for mphf_benchmark:
Users that are interested in mphf_benchmark 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.β29Updated 4 months ago
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ43Updated 6 months ago
- Fast and compact minimal perfect hash functions in C++.β220Updated last month
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 2 years ago
- C++ Implementation of Zip Treesβ14Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ42Updated this week
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 4 years ago
- Learned Monotone Minimal Perfect Hashingβ25Updated 3 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β19Updated 3 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- β53Updated 10 months ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β30Updated 2 months ago
- Fast in-place radix sort with STL-like APIβ46Updated 8 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 β¦β26Updated 2 years ago
- For details, see the blog post:β32Updated last year
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.β29Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionaryβ33Updated last month
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)β52Updated 7 years ago
- AVX512F and AVX2 versions of quick sortβ105Updated 7 years ago
- Additional C++11 Random Distributionsβ17Updated 9 months ago
- Compact Tree Representationβ16Updated 8 years ago
- Fast Hash Functions Using AES Intrinsicsβ82Updated 5 years ago
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ26Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ49Updated 3 years ago
- String map implementation through Fast Succinct Trieβ21Updated 3 years ago
- β38Updated 4 years ago
- std::map/std::set implementation using the adaptive radix treeβ13Updated 3 years ago
- Succinct Data Structure Library 3.0β94Updated 6 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operationsβ45Updated 5 years ago
- Bit packed vector of integral valuesβ27Updated last month