73 lines
2.2 KiB
Rust
73 lines
2.2 KiB
Rust
|
use criterion::async_executor::FuturesExecutor;
|
||
|
|
use criterion::{black_box, criterion_group, criterion_main, Criterion, Throughput};
|
||
|
|
use rand::prelude::SliceRandom;
|
||
|
|
use rand::thread_rng;
|
||
|
|
use serde::de::DeserializeOwned;
|
||
|
|
use serde::Serialize;
|
||
|
|
use std::time::Duration;
|
||
|
|
use surrealdb::idx::bkeys::{BKeys, FstKeys, TrieKeys};
|
||
|
|
use surrealdb::idx::btree::store::{BTreeNodeStore, BTreeStoreType, KeyProvider};
|
||
|
|
use surrealdb::idx::btree::{BTree, Payload, State};
|
||
|
|
use surrealdb::kvs::{Datastore, Key};
|
||
|
|
|
||
|
|
macro_rules! get_key_value {
|
||
|
|
($idx:expr) => {{
|
||
|
|
(format!("{}", $idx).into(), ($idx * 10) as Payload)
|
||
|
|
}};
|
||
|
|
}
|
||
|
|
|
||
|
|
fn bench_index_btree(c: &mut Criterion) {
|
||
|
|
let (samples_len, samples) = setup();
|
||
|
|
|
||
|
|
let mut group = c.benchmark_group("index_btree");
|
||
|
|
group.throughput(Throughput::Elements(1));
|
||
|
|
group.sample_size(10);
|
||
|
|
group.measurement_time(Duration::from_secs(30));
|
||
|
|
|
||
|
|
group.bench_function("btree-insertion-fst", |b| {
|
||
|
|
b.to_async(FuturesExecutor)
|
||
|
|
.iter(|| bench::<_, FstKeys>(samples_len, |i| get_key_value!(samples[i])))
|
||
|
|
});
|
||
|
|
|
||
|
|
group.bench_function("btree-insertion-trie", |b| {
|
||
|
|
b.to_async(FuturesExecutor)
|
||
|
|
.iter(|| bench::<_, TrieKeys>(samples_len, |i| get_key_value!(samples[i])))
|
||
|
|
});
|
||
|
|
|
||
|
|
group.finish();
|
||
|
|
}
|
||
|
|
|
||
|
|
fn setup() -> (usize, Vec<usize>) {
|
||
|
|
let samples_len = if cfg!(debug_assertions) {
|
||
|
|
1000 // debug is much slower!
|
||
|
|
} else {
|
||
|
|
100_000
|
||
|
|
};
|
||
|
|
let mut samples: Vec<usize> = (0..samples_len).collect();
|
||
|
|
let mut rng = thread_rng();
|
||
|
|
samples.shuffle(&mut rng);
|
||
|
|
(samples_len, samples)
|
||
|
|
}
|
||
|
|
|
||
|
|
async fn bench<F, BK>(samples_size: usize, sample_provider: F)
|
||
|
|
where
|
||
|
|
F: Fn(usize) -> (Key, Payload),
|
||
|
|
BK: BKeys + Serialize + DeserializeOwned + Default,
|
||
|
|
{
|
||
|
|
let ds = Datastore::new("memory").await.unwrap();
|
||
|
|
let mut tx = ds.transaction(true, false).await.unwrap();
|
||
|
|
let mut t = BTree::<BK>::new(State::new(100));
|
||
|
|
let s = BTreeNodeStore::new(KeyProvider::Debug, BTreeStoreType::Write, 20);
|
||
|
|
let mut s = s.lock().await;
|
||
|
|
for i in 0..samples_size {
|
||
|
|
let (key, payload) = sample_provider(i);
|
||
|
|
// Insert the sample
|
||
|
|
t.insert(&mut tx, &mut s, key.clone(), payload).await.unwrap();
|
||
|
|
// Search for it
|
||
|
|
black_box(t.search(&mut tx, &mut s, &key).await.unwrap());
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
criterion_group!(benches, bench_index_btree);
|
||
|
|
criterion_main!(benches);
|