Fast Approximate Membership Filters (C++)
☆286Sep 21, 2026Updated last month
Alternatives and similar repositories for fastfilter_cpp
Users that are interested in fastfilter_cpp are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Header-only binary fuse and xor filter library☆435Oct 9, 2026Updated 3 weeks ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆50Sep 12, 2022Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- MIT dsail research project☆12May 14, 2020Updated 6 years ago
- ☆55Nov 23, 2024Updated last year
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Bumped Ribbon Retrieval and Approximate Membership Query☆52Sep 13, 2026Updated last month
- ☆1,014Nov 12, 2021Updated 4 years ago
- Fast Approximate Membership Filters (C++)☆25Apr 27, 2021Updated 5 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆131Aug 3, 2023Updated 3 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆90Dec 16, 2020Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 3 years ago
- ☆40Jun 20, 2020Updated 6 years ago
- BitMagic Library☆456Oct 18, 2026Updated last week
- Benchmarking Bloom, Cuckoo, Morton, and PD based filter.☆15Mar 19, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆31Aug 16, 2019Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Go library implementing binary fuse and xor filters☆766Jan 26, 2026Updated 9 months ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 7 years ago
- ☆30Sep 14, 2022Updated 4 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Feb 23, 2023Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆37Jun 8, 2016Updated 10 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆11Nov 1, 2019Updated 6 years ago
- First Practical and General-purpose Range Filter☆554Mar 11, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- 🚀 Fast C/C++ bit population count library☆371Jul 23, 2026Updated 3 months ago
- Bloom-filter based minimal perfect hash function library☆281Jul 16, 2025Updated last year
- Bloom filter alternative (C++)☆18Nov 8, 2018Updated 7 years ago
- Fast integer compression in C using the StreamVByte codec☆418Oct 14, 2026Updated 2 weeks ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆256Nov 28, 2021Updated 4 years ago
- ☆16Mar 16, 2021Updated 5 years ago
- ☆17May 24, 2022Updated 4 years ago
- The FastPFOR C++ library: Fast integer compression☆978Oct 4, 2026Updated 3 weeks ago
- ☆129May 25, 2026Updated 5 months ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- A fast SIMD parser for CSV files☆164Jul 2, 2022Updated 4 years ago
- Library for lock-free locks☆89Jun 26, 2023Updated 3 years ago
- A family of header-only, very fast and memory-friendly hashmap and btree containers.☆3,225Sep 10, 2026Updated last month
- RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.☆103Mar 30, 2023Updated 3 years ago
- ☆12Jul 4, 2020Updated 6 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆449Jun 7, 2026Updated 4 months ago
- A simple, reference implementation of a B^e-tree☆170Mar 25, 2019Updated 7 years ago