Prefix Filter: Practically and Theoretically Better Than Bloom.
-
Updated
Sep 12, 2022 - C++
Prefix Filter: Practically and Theoretically Better Than Bloom.
Bumped Ribbon Retrieval and Approximate Membership Query
Compact cache-friendly filter, for small number of elements.
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."