Skip to content

Concurrent in-memory B+ Tree featuring optimistic lock coupling

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT
Notifications You must be signed in to change notification settings

andrebsguedes/bplustree

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

BPlusTree

Implementation of a fast in-memory concurrent B+ Tree featuring optimistic lock coupling. The implementation is based on LeanStore with some adaptations from Umbra.

The current API is very basic and more features are supposed to be added in the following versions, it tries to loosely follow the std::collections::BTreeMap API.

Currently it is not heavily optimized but is already faster than some concurrent lock-free implementations. Single threaded performance is generally slower (~ 1.4x) but still comparable to std::collections::BTreeMap with sligthly faster scans due to the B+ Tree topology.

For how to use it refer to the documentation

About

Concurrent in-memory B+ Tree featuring optimistic lock coupling

Resources

License

Apache-2.0, MIT licenses found

Licenses found

Apache-2.0
LICENSE-APACHE
MIT
LICENSE-MIT

Stars

Watchers

Forks

Packages

No packages published

Languages

  • Rust 100.0%