Bumped Ribbon Retrieval and Approximate Membership Query
Prefix Filter: Practically and Theoretically Better Than Bloom.
A high-performance DuckDB extension providing probabilistic data structures for fast set membership testing and approximate duplicate detection. This extension implements state-of-the-art filter algorithms including Quotient filters, XOR filters, Binary Fuse filters, and soon Bloom filters.
Compact cache-friendly filter, for small number of elements.
Benchmarking Approximate Membership Query (AMQ) data structures (Bloom Filter, Cuckoo Filter)
This repository contains the implementation code for my personal study of the "Sparse Numerical Array-Based Range Filters" (SNARF) data structure by exploring the integration of various non-linear kernel functions.
Add a description, image, and links to the approximate-membership-query topic page so that developers can more easily learn about it.
To associate your repository with the approximate-membership-query topic, visit your repo's landing page and select "manage topics."