pdillinger / fastfilter_cppLinks
Fast Approximate Membership Filters (C++)
☆22Updated 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☆50Updated 6 months ago
- ☆53Updated last year
- Succinct data structures in C/C++☆92Updated last year
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- A fast SIMD parser for CSV files☆160Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆288Updated 4 months ago
- A Wait-Free Universal Construct for Large Objects☆96Updated 6 years ago
- FishStore is a prototype fast ingestion and querying layer for flexible-schema data☆232Updated 2 years ago
- An Evaluation of Linear Probing Hashtable Algorithms☆39Updated 2 years ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 9 months ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- Clustered Elias-Fano inverted indexes.☆15Updated 7 years ago
- Comparing linear and binary searches☆43Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 5 years ago
- A C++ library for integer array compression☆30Updated 3 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Persistent memory allocator for data-centric analytics☆58Updated 2 months ago
- Header-only vectorized, lazy-decoding, zero-copy CSV file parser☆99Updated last year
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 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
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Library for lock-free locks☆83Updated 2 years ago