aedb 0.2.2

Embedded Rust storage engine with transactional commits, WAL durability, and snapshot-consistent reads
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242

//! Scaling sweeps: how do upsert/KV/index costs change with size?
//!
//!   cargo bench --bench scale -- --save-baseline scale_main

use aedb::AedbInstance;
use aedb::catalog::DdlOperation;
use aedb::catalog::schema::{ColumnDef, IndexType};
use aedb::catalog::types::{ColumnType, Row, Value};
use aedb::commit::validation::Mutation;
use aedb::config::AedbConfig;
use criterion::{Criterion, black_box, criterion_group, criterion_main};
use tempfile::tempdir;
use tokio::runtime::Runtime;

const PROJECT_ID: &str = "p";
const SCOPE_ID: &str = "app";
const TABLE_NAME: &str = "users";

async fn setup_table(db: &AedbInstance) {
    db.create_project(PROJECT_ID).await.expect("project");
    db.commit(Mutation::Ddl(DdlOperation::CreateTable {
        project_id: PROJECT_ID.into(),
        scope_id: SCOPE_ID.into(),
        table_name: TABLE_NAME.into(),
        owner_id: None,
        if_not_exists: false,
        columns: vec![
            ColumnDef {
                name: "id".into(),
                col_type: ColumnType::Integer,
                nullable: false,
            },
            ColumnDef {
                name: "name".into(),
                col_type: ColumnType::Text,
                nullable: false,
            },
            ColumnDef {
                name: "age".into(),
                col_type: ColumnType::Integer,
                nullable: false,
            },
        ],
        primary_key: vec!["id".into()],
    }))
    .await
    .expect("create table");
}

async fn seed_rows(db: &AedbInstance, count: i64, batch: i64) {
    let mut id = 0_i64;
    while id < count {
        let n = batch.min(count - id);
        let mut rows = Vec::with_capacity(n as usize);
        for _ in 0..n {
            rows.push(Row {
                values: vec![
                    Value::Integer(id),
                    Value::Text(format!("user_{id}").into()),
                    Value::Integer(20 + (id % 60)),
                ],
            });
            id += 1;
        }
        db.commit(Mutation::UpsertBatch {
            project_id: PROJECT_ID.into(),
            scope_id: SCOPE_ID.into(),
            table_name: TABLE_NAME.into(),
            rows,
        })
        .await
        .expect("seed batch");
    }
}

/// How does single-row upsert latency change as the table grows?
/// Tests `im::OrdMap` log-N clone cost on the primary index.
fn bench_upsert_at_table_size(c: &mut Criterion) {
    let rt = Runtime::new().expect("rt");
    for &size in &[10_000_i64, 100_000, 500_000] {
        let dir = tempdir().expect("tempdir");
        let db = rt.block_on(async {
            AedbInstance::open(AedbConfig::default(), dir.path()).expect("open")
        });
        rt.block_on(async {
            setup_table(&db).await;
            seed_rows(&db, size, 256).await;
        });

        let mut next_id = size;
        c.bench_function(&format!("upsert_at_table_size_{size}"), |b| {
            b.iter(|| {
                rt.block_on(async {
                    let id = black_box(next_id);
                    next_id += 1;
                    db.commit(Mutation::Upsert {
                        project_id: PROJECT_ID.into(),
                        scope_id: SCOPE_ID.into(),
                        table_name: TABLE_NAME.into(),
                        primary_key: vec![Value::Integer(id)],
                        row: Row {
                            values: vec![
                                Value::Integer(id),
                                Value::Text("scale-bench".into()),
                                Value::Integer(30),
                            ],
                        },
                    })
                    .await
                    .expect("upsert");
                });
            })
        });
        // tempdir dropped at end of loop iter
        drop(db);
        drop(dir);
    }
}

/// How does KV set/get latency change with value size?
fn bench_kv_value_size(c: &mut Criterion) {
    let rt = Runtime::new().expect("rt");
    for &vsize in &[64_usize, 1024, 16_384, 131_072] {
        let dir = tempdir().expect("tempdir");
        let db = rt.block_on(async {
            AedbInstance::open(AedbConfig::default(), dir.path()).expect("open")
        });
        rt.block_on(async {
            db.create_project(PROJECT_ID).await.expect("project");
            db.create_scope(PROJECT_ID, SCOPE_ID).await.expect("scope");
        });

        let payload = vec![0xABu8; vsize];
        let mut next_idx = 0_u64;
        c.bench_function(&format!("kv_set_value_{vsize}b"), |b| {
            b.iter(|| {
                rt.block_on(async {
                    let i = black_box(next_idx);
                    next_idx += 1;
                    let key = format!("k:{i:08}").into_bytes();
                    db.commit(Mutation::KvSet {
                        project_id: PROJECT_ID.into(),
                        scope_id: SCOPE_ID.into(),
                        key,
                        value: payload.clone(),
                    })
                    .await
                    .expect("kv set");
                });
            })
        });
        drop(db);
        drop(dir);
    }
}

/// How does upsert cost scale with the number of secondary indexes?
fn bench_upsert_with_n_indexes(c: &mut Criterion) {
    let rt = Runtime::new().expect("rt");
    for &nidx in &[0_usize, 1, 4, 8] {
        let dir = tempdir().expect("tempdir");
        let db = rt.block_on(async {
            AedbInstance::open(AedbConfig::default(), dir.path()).expect("open")
        });
        rt.block_on(async {
            db.create_project(PROJECT_ID).await.expect("project");
            db.commit(Mutation::Ddl(DdlOperation::CreateTable {
                project_id: PROJECT_ID.into(),
                scope_id: SCOPE_ID.into(),
                table_name: TABLE_NAME.into(),
                owner_id: None,
                if_not_exists: false,
                columns: {
                    let mut cols = vec![ColumnDef {
                        name: "id".into(),
                        col_type: ColumnType::Integer,
                        nullable: false,
                    }];
                    for i in 0..8 {
                        cols.push(ColumnDef {
                            name: format!("c{i}"),
                            col_type: ColumnType::Integer,
                            nullable: false,
                        });
                    }
                    cols
                },
                primary_key: vec!["id".into()],
            }))
            .await
            .expect("create table");

            for i in 0..nidx {
                db.commit(Mutation::Ddl(DdlOperation::CreateIndex {
                    project_id: PROJECT_ID.into(),
                    scope_id: SCOPE_ID.into(),
                    table_name: TABLE_NAME.into(),
                    index_name: format!("idx_c{i}"),
                    columns: vec![format!("c{i}")],
                    index_type: IndexType::BTree,
                    partial_filter: None,
                    if_not_exists: false,
                }))
                .await
                .expect("create index");
            }
        });

        let mut next_id = 0_i64;
        c.bench_function(&format!("upsert_with_{nidx}_indexes"), |b| {
            b.iter(|| {
                rt.block_on(async {
                    let id = black_box(next_id);
                    next_id += 1;
                    let mut values = vec![Value::Integer(id)];
                    for i in 0..8 {
                        values.push(Value::Integer((id + i as i64) % 1024));
                    }
                    db.commit(Mutation::Upsert {
                        project_id: PROJECT_ID.into(),
                        scope_id: SCOPE_ID.into(),
                        table_name: TABLE_NAME.into(),
                        primary_key: vec![Value::Integer(id)],
                        row: Row { values },
                    })
                    .await
                    .expect("upsert");
                });
            })
        });
        drop(db);
        drop(dir);
    }
}

criterion_group!(
    scale,
    bench_upsert_at_table_size,
    bench_kv_value_size,
    bench_upsert_with_n_indexes
);
criterion_main!(scale);