pdillinger / fastfilter_cppLinks
Fast Approximate Membership Filters (C++)
☆24Updated 4 years ago
Alternatives and similar repositories for fastfilter_cpp
Users that are interested in fastfilter_cpp are comparing it to the libraries listed below
Sorting:
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Updated 7 months ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- ☆53Updated last year
- A fast SIMD parser for CSV files☆159Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- Fast Approximate Membership Filters (C++)☆288Updated 5 months ago
- Succinct data structures in C/C++☆92Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated 2 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆39Updated 2 years ago
- High-performance dictionary coding☆109Updated 8 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 7 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆89Updated 5 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 6 years 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
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆132Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 10 months ago
- Comparing linear and binary searches☆43Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- a quotient filter written in C☆88Updated 8 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago