Skip to content

bgianfo/arf

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

54 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

ARF - Adaptive Range Filter

Build Status Coverage Status Doc Status

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.

External Resources:

  • Original paper from Microsoft Research (MSR) describing the data structure: pdf
  • Landing page for the paper: link

About

An Adaptive Range Filter Implementation In Elixir

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages