LinHash

Linear Hashing implementation in Rust.

What's good about Linear Hashing?

• It is a on-disk data structure to maintain key-value mappings.
• It doesn't use much RAM except temporary buffers.
• Since queries need only one or two reads from the disk, it is very fast.
• The query performance isn't affected by the database size.
• Concurrency is studied in Concurrency in linear hashing.
• The algorithm is simple and elegant.

What's good about this implementation?

• GETs and INSERTs are fully concurrent.
• Use rkyv's zero-copy deserialization for fast queries.
• Use RWF_ATOMIC flag for avoiding torn writes.

Type-safe concurrency

Each operation is designed to take a hierarchy of locks before doing its work. This is type-checked by Rust compiler.

Limitations

• Key size and value size must be fixed.

Example

The API is as same as HashMap.

use linhash::LinHash;

let dir = tempfile::tempdir().unwrap();
let ksize = 2;
let vsize = 4;
let db = LinHash::open(dir.path(), ksize, vsize).unwrap();

db.insert(vec![1, 2], vec![3, 4, 5, 6]).unwrap();
let old = db.insert(vec![1, 2], vec![7, 8, 9, 10]).unwrap();
assert_eq!(old, Some(vec![3, 4, 5, 6]));

assert_eq!(db.get(&vec![1, 2]).unwrap(), Some(vec![7, 8, 9, 10]));

let old = db.delete(&vec![1, 2]).unwrap();
assert_eq!(old, Some(vec![7, 8, 9, 10]));
assert_eq!(db.get(&vec![1, 2]).unwrap(), None);

Cargo Features