https://github.com/bgianfo/arf

An Adaptive Range Filter Implementation In Elixir
https://github.com/bgianfo/arf

Last synced: 10 months ago
JSON representation

An Adaptive Range Filter Implementation In Elixir

• Host: GitHub
• URL: https://github.com/bgianfo/arf
• Owner: bgianfo
• License: bsd-2-clause
• Created: 2014-12-25T07:33:12.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2023-10-11T13:44:30.000Z (almost 3 years ago)
• Last Synced: 2025-03-16T00:14:09.627Z (over 1 year ago)
• Language: Elixir
• Size: 48.8 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE.md

Awesome Lists containing this project

README

          
ARF - Adaptive Range Filter

===

[![Build Status](https://travis-ci.org/bgianfo/arf.svg?branch=master)](https://travis-ci.org/bgianfo/arf)

[![Coverage Status](https://coveralls.io/repos/bgianfo/arf/badge.png?branch=master)](https://coveralls.io/r/bgianfo/arf?branch=master)

[![Doc Status](http://inch-ci.org/github/bgianfo/arf.svg?branch=master)](http://inch-ci.org/github/bgianfo/arf)

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](http://research.microsoft.com/pubs/220613/p1714-kossmann.pdf)

 - Landing page for the paper: [link](http://research.microsoft.com/apps/pubs/default.aspx?id=220613)