ByteHamster / LeMonHashLinks
Learned Monotone Minimal Perfect Hashing
☆27Updated 4 months ago
Alternatives and similar repositories for LeMonHash
Users that are interested in LeMonHash are comparing it to the libraries listed below
Sorting:
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 4 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆46Updated 2 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 6 months ago
- Packed and Compressed Hash Tables☆15Updated 4 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Succinct data structures in C/C++☆88Updated 10 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Library for lock-free locks☆82Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆280Updated 7 months ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- A blend of the compact and sparse hash table implementations.☆15Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- ☆38Updated 5 years ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 7 months ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- ☆108Updated last year