vsdb_core 14.0.13

A std-collection-like database
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

use criterion::{Criterion, black_box, criterion_group};
use std::time::Duration;
use vsdb_core::MapxRaw;

// Benchmark single insert operations
fn single_inserts(c: &mut Criterion) {
    let mut group = c.benchmark_group("vsdb_core::mapx_raw / batch_write");
    group
        .measurement_time(std::time::Duration::from_secs(3))
        .sample_size(10);

    group.bench_function(" single inserts (1000 ops) ", |b| {
        b.iter(|| {
            let mut db = MapxRaw::new();
            for i in 0usize..1000 {
                let key = i.to_be_bytes();
                let value = (i * 2).to_be_bytes();
                db.insert(&key, &value);
            }
            black_box(db);
        })
    });

    group.finish();
}

// Benchmark mixed read/write workload
fn mixed_workload(c: &mut Criterion) {
    let mut group = c.benchmark_group("vsdb_core::mapx_raw / mixed");
    group
        .measurement_time(std::time::Duration::from_secs(3))
        .sample_size(10);

    group.bench_function(" 80% read / 20% write (1000 ops) ", |b| {
        b.iter(|| {
            let mut db = MapxRaw::new();
            // Pre-populate
            for i in 0usize..800 {
                let key = i.to_be_bytes();
                let value = i.to_be_bytes();
                db.insert(&key, &value);
            }

            // Mixed workload
            for i in 0usize..1000 {
                if i % 5 == 0 {
                    // 20% writes
                    let key = (800 + i / 5).to_be_bytes();
                    let value = i.to_be_bytes();
                    db.insert(&key, &value);
                } else {
                    // 80% reads
                    let key = (i % 800).to_be_bytes();
                    black_box(db.get(&key));
                }
            }
            black_box(db);
        })
    });

    group.finish();
}

// Benchmark range scans
fn range_scans(c: &mut Criterion) {
    let mut group = c.benchmark_group("vsdb_core::mapx_raw / range_scan");
    group
        .measurement_time(std::time::Duration::from_secs(3))
        .sample_size(10);

    let mut db = MapxRaw::new();
    // Pre-populate with 10000 entries
    for i in 0u64..10000u64 {
        let key = i.to_be_bytes();
        let value = i.to_be_bytes();
        db.insert(&key, &value);
    }

    group.bench_function(" scan 100 entries ", |b| {
        b.iter(|| {
            let count = db.iter().take(100).count();
            black_box(count);
        })
    });

    group.bench_function(" scan 1000 entries ", |b| {
        b.iter(|| {
            let count = db.iter().take(1000).count();
            black_box(count);
        })
    });

    group.finish();
}

criterion_group!(benches, single_inserts, mixed_workload, range_scans);