Current Status: Prototype
An Adaptive Range Filter (ARF) is a tree based data structure which is to range queries, as a bloom filter is to point queries.
Goals of the ARF data structure:
- Storage Efficient
- Efficient Lookup
- Very low risk of false negatives
- Less strong guarantee's about false positives.
- Trained and refined through querying.
This project is an attempt to implement an Adaptive Range Filter in Elixir.