range-filters 0.1.0

High-performance range filter implementation - DIVA (VLDB 2025 Best Research Paper)
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30

use fastbloom::BloomFilter;

fn range_query(bloom: &BloomFilter, start: u64, end: u64) -> bool {
    for key in start..=end {
        let key_str = key.to_string();
        if bloom.contains(&key_str) {
            return true;
        }
    }
    false
}

fn main() {
    let mut bloom = BloomFilter::with_false_pos(0.01).expected_items(1000);

    let keys = vec![100u64, 500, 1000, 5000, 10000];
    bloom.insert_all(&keys.iter().map(|&num| num.to_string()).collect::<Vec<String>>());

    println!("Keys:");
    println!("{:?}", keys);

    println!("\nPoint queries:");
    println!("  '500': {}", bloom.contains("500"));
    println!("  '999': {}", bloom.contains("999"));

    println!("\nRange queries:");
    println!("  [0, 200]: {}", range_query(&bloom, 0, 200));
    println!("  [200, 400]: {}", range_query(&bloom, 200, 400));
    println!("  [400, 600]: {}", range_query(&bloom, 400, 600));
}