mirror of
https://github.com/tursodatabase/limbo.git
synced 2025-08-04 18:18:03 +00:00
7a6ca27986
For the time being, we still assume that the row versions vector is *nearly* sorted, so we just perform a linear reverse search and insert the version at an appropriate place. During concurrency tests, the error was at most 1 offset, and as long as we empirically prove it to be below a reasonable constant, we're fine. Otherwise we should consider switching to either a data structure that keeps elements ordered, or at least a list that gives us constant insertion. |
||
|---|---|---|
| .. | ||
| .github/workflows | ||
| bindings/c | ||
| docs | ||
| mvcc-rs | ||
| .gitignore | ||
| Cargo.toml | ||
| LICENSE.md | ||
| README.md | ||
MVCC for Rust
This is a work-in-progress the Hekaton optimistic multiversion concurrency control library in Rust. The aim of the project is to provide a building block for implementing database management systems.
Features
- Main memory architecture, rows are accessed via an index
- Optimistic multi-version concurrency control
- Rust and C APIs
Experimental Evaluation
Single-threaded micro-benchmarks
| Operations | Throughput |
|---|---|
begin_tx, read, and commit |
2.2M ops/second |
begin_tx, update, and commit |
2.2M ops/second |
read |
12.9M ops/second |
update |
6.2M ops/second |
(The cargo bench was run on a AMD Ryzen 9 3900XT 2.2 GHz CPU.)
Development
Run tests:
cargo test
Test coverage report:
cargo tarpaulin -o html
Run benchmarks:
cargo bench
Run benchmarks and generate flamegraphs:
echo -1 | sudo tee /proc/sys/kernel/perf_event_paranoid
cargo bench --bench my_benchmark -- --profile-time=5
References
Larson et al. High-Performance Concurrency Control Mechanisms for Main-Memory Databases. VLDB '11
Paper errata: The visibility check in Table 2 is wrong and causes uncommitted delete to become visible to transactions (fixed in commit 6ca3773).