jbapple / libfilterLinks
High-speed Bloom filters and taffy filters for C, C++, and Java
☆35Updated last year
Alternatives and similar repositories for libfilter
Users that are interested in libfilter are comparing it to the libraries listed below
Sorting:
- ☆51Updated 7 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated 3 weeks ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆279Updated 6 months ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- a quotient filter written in C☆84Updated 7 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- ☆38Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A fast approximate membership query data structure☆11Updated 11 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 4 months ago
- Fast Approximate Membership Filters (C++)☆22Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 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
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆30Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 3 months ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- ☆54Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- ☆29Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 10 months ago
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated 7 months ago