Re-hash keys before storing in LMDB to improve key distribution and avoid prefixes

This commit is contained in:
Withings 2024-10-23 17:19:30 +02:00
parent a18b3f0d1f
commit 45425a5637
Signed by untrusted user: withings
GPG key ID: 7778B323E465AABB
2 changed files with 58 additions and 10 deletions

View file

@ -15,6 +15,9 @@ path = "lib.rs"
err-derive.workspace = true err-derive.workspace = true
hexdump.workspace = true hexdump.workspace = true
tracing.workspace = true tracing.workspace = true
opentelemetry.workspace = true
opentelemetry.workspace = true
xxhash-rust.workspace = true
heed = { workspace = true, optional = true } heed = { workspace = true, optional = true }
rusqlite = { workspace = true, optional = true, features = ["backup"] } rusqlite = { workspace = true, optional = true, features = ["backup"] }

View file

@ -10,6 +10,8 @@ use std::sync::{Arc, RwLock};
use heed::types::ByteSlice; use heed::types::ByteSlice;
use heed::{BytesDecode, Env, RoTxn, RwTxn, UntypedDatabase as Database}; use heed::{BytesDecode, Env, RoTxn, RwTxn, UntypedDatabase as Database};
use xxhash_rust::xxh3::xxh3_128;
use crate::{ use crate::{
Db, Error, IDb, ITx, ITxFn, OnCommit, Result, TxError, TxFnResult, TxOpError, TxOpResult, Db, Error, IDb, ITx, ITxFn, OnCommit, Result, TxError, TxFnResult, TxOpError, TxOpResult,
TxResult, TxValueIter, Value, ValueIter, TxResult, TxValueIter, Value, ValueIter,
@ -58,6 +60,40 @@ impl LmdbDb {
} }
} }
fn key_hash(key: &[u8]) -> [u8; 16] {
xxh3_128(key).to_ne_bytes()
}
fn kv_to_value(key: &[u8], value: &[u8]) -> Vec<u8> {
[&key.len().to_ne_bytes(), key, value].concat()
}
fn value_to_kv(value: &[u8]) -> (Vec<u8>, Vec<u8>) {
const USIZE_LEN: usize = std::mem::size_of::<usize>();
let klen = usize::from_ne_bytes(value[0..USIZE_LEN].try_into().unwrap());
(
value[USIZE_LEN..klen+USIZE_LEN].to_vec(),
value[USIZE_LEN+klen..].to_vec()
)
}
fn key_hash(key: &[u8]) -> [u8; 16] {
xxh3_128(key).to_ne_bytes()
}
fn kv_to_value(key: &[u8], value: &[u8]) -> Vec<u8> {
[&key.len().to_ne_bytes(), key, value].concat()
}
fn value_to_kv(value: &[u8]) -> (Vec<u8>, Vec<u8>) {
const USIZE_LEN: usize = std::mem::size_of::<usize>();
let klen = usize::from_ne_bytes(value[0..USIZE_LEN].try_into().unwrap());
(
value[USIZE_LEN..klen+USIZE_LEN].to_vec(),
value[USIZE_LEN+klen..].to_vec()
)
}
impl IDb for LmdbDb { impl IDb for LmdbDb {
fn engine(&self) -> String { fn engine(&self) -> String {
"LMDB (using Heed crate)".into() "LMDB (using Heed crate)".into()
@ -119,10 +155,11 @@ impl IDb for LmdbDb {
let tree = self.get_tree(tree)?; let tree = self.get_tree(tree)?;
let tx = self.db.read_txn()?; let tx = self.db.read_txn()?;
let val = tree.get(&tx, key)?; let kh = key_hash(key);
let val = tree.get(&tx, &kh)?;
match val { match val {
None => Ok(None), None => Ok(None),
Some(v) => Ok(Some(v.to_vec())), Some(v) => Ok(Some(value_to_kv(v).1))
} }
} }
@ -135,7 +172,9 @@ impl IDb for LmdbDb {
fn insert(&self, tree: usize, key: &[u8], value: &[u8]) -> Result<()> { fn insert(&self, tree: usize, key: &[u8], value: &[u8]) -> Result<()> {
let tree = self.get_tree(tree)?; let tree = self.get_tree(tree)?;
let mut tx = self.db.write_txn()?; let mut tx = self.db.write_txn()?;
tree.put(&mut tx, key, value)?; let kh = key_hash(key);
let value = kv_to_value(key, value);
tree.put(&mut tx, &kh, &value)?;
tx.commit()?; tx.commit()?;
Ok(()) Ok(())
} }
@ -143,7 +182,8 @@ impl IDb for LmdbDb {
fn remove(&self, tree: usize, key: &[u8]) -> Result<()> { fn remove(&self, tree: usize, key: &[u8]) -> Result<()> {
let tree = self.get_tree(tree)?; let tree = self.get_tree(tree)?;
let mut tx = self.db.write_txn()?; let mut tx = self.db.write_txn()?;
tree.delete(&mut tx, key)?; let kh = key_hash(key);
tree.delete(&mut tx, &kh)?;
tx.commit()?; tx.commit()?;
Ok(()) Ok(())
} }
@ -242,8 +282,9 @@ impl<'a> LmdbTx<'a> {
impl<'a> ITx for LmdbTx<'a> { impl<'a> ITx for LmdbTx<'a> {
fn get(&self, tree: usize, key: &[u8]) -> TxOpResult<Option<Value>> { fn get(&self, tree: usize, key: &[u8]) -> TxOpResult<Option<Value>> {
let tree = self.get_tree(tree)?; let tree = self.get_tree(tree)?;
match tree.get(&self.tx, key)? { let kh = key_hash(key);
Some(v) => Ok(Some(v.to_vec())), match tree.get(&self.tx, &kh)? {
Some(v) => Ok(Some(value_to_kv(v).1)),
None => Ok(None), None => Ok(None),
} }
} }
@ -254,14 +295,18 @@ impl<'a> ITx for LmdbTx<'a> {
fn insert(&mut self, tree: usize, key: &[u8], value: &[u8]) -> TxOpResult<()> { fn insert(&mut self, tree: usize, key: &[u8], value: &[u8]) -> TxOpResult<()> {
let tree = *self.get_tree(tree)?; let tree = *self.get_tree(tree)?;
tree.put(&mut self.tx, key, value)?; let kh = key_hash(key);
let value = kv_to_value(key, value);
tree.put(&mut self.tx, &kh, &value)?;
Ok(()) Ok(())
} }
fn remove(&mut self, tree: usize, key: &[u8]) -> TxOpResult<()> { fn remove(&mut self, tree: usize, key: &[u8]) -> TxOpResult<()> {
let tree = *self.get_tree(tree)?; let tree = *self.get_tree(tree)?;
tree.delete(&mut self.tx, key)?; let kh = key_hash(key);
tree.delete(&mut self.tx, &kh)?;
Ok(()) Ok(())
} }
fn clear(&mut self, tree: usize) -> TxOpResult<()> { fn clear(&mut self, tree: usize) -> TxOpResult<()> {
let tree = *self.get_tree(tree)?; let tree = *self.get_tree(tree)?;
tree.clear(&mut self.tx)?; tree.clear(&mut self.tx)?;
@ -370,7 +415,7 @@ where
match next { match next {
None => None, None => None,
Some(Err(e)) => Some(Err(e.into())), Some(Err(e)) => Some(Err(e.into())),
Some(Ok((k, v))) => Some(Ok((k.to_vec(), v.to_vec()))), Some(Ok((_k, v))) => Some(Ok(value_to_kv(v))),
} }
} }
} }
@ -380,7 +425,7 @@ where
fn tx_iter_item<'a>( fn tx_iter_item<'a>(
item: std::result::Result<(&'a [u8], &'a [u8]), heed::Error>, item: std::result::Result<(&'a [u8], &'a [u8]), heed::Error>,
) -> TxOpResult<(Vec<u8>, Vec<u8>)> { ) -> TxOpResult<(Vec<u8>, Vec<u8>)> {
item.map(|(k, v)| (k.to_vec(), v.to_vec())) item.map(|(_k, v)| value_to_kv(v))
.map_err(|e| TxOpError(Error::from(e))) .map_err(|e| TxOpError(Error::from(e)))
} }