roberto-trani / mphf_benchmarkLinks
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
Sorting:
- πΆ Compressed bitvector/container supporting efficient random access and rank queriesβ43Updated 9 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.β30Updated 2 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.β48Updated 2 years ago
- C++ Implementation of Zip Treesβ14Updated 2 years ago
- βοΈ PTHash is a fast and compact minimal perfect hash function.β230Updated 3 weeks 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 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPSΒ²Ra)β32Updated 5 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.β19Updated 2 months ago
- A Rust implementation of the Quad Wavelet Treeβ42Updated last month
- Additional C++11 Random Distributionsβ18Updated last year
- Bit packed vector of integral valuesβ27Updated 4 months ago
- Fast in-place radix sort with STL-like APIβ47Updated 8 years ago
- Learned Monotone Minimal Perfect Hashingβ27Updated 2 months ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.β35Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLogβ49Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisionsβ43Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)β52Updated 8 years ago
- β54Updated last year
- Bicriteria Data Compressorβ14Updated 7 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergβ¦β10Updated 6 years ago
- std::map/std::set implementation using the adaptive radix treeβ15Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Queryβ45Updated last week
- β44Updated 4 years ago
- String map implementation through Fast Succinct Trieβ21Updated 3 years ago
- Wavelet tree based on a fixed block boosting techniqueβ16Updated 4 years ago
- Fast Hash Functions Using AES Intrinsicsβ82Updated 5 years ago
- Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)β13Updated 8 years ago
- Parallel Wavelet Tree and Wavelet Matrix Constructionβ26Updated last year
- For details, see the blog post:β32Updated last year
- AVX512F and AVX2 versions of quick sortβ104Updated 7 years ago