the champagne of beta embedded databases
An efficient, conscise, and simple implementation of a purely on-disk B+ Tree data structure
A relational database engine using B+ tree indexing
Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
This is the implementation repository of our SOSP'24 paper: CHIME: A Cache-Efficient and High-Performance Hybrid Index on Disaggregated Memory.
An implementation of B+Tree (a multiway search tree based on the memory, i.e., all data records are stored in the memory instead of the disk).
pure B+Tree that mimics the implementation of std::collections::BTreeMap
A growable array (vector) implemented as a B-tree
Waterwheel is a distributed append-only store supporting millions insertions per second and realtime temporal and key range query
Kiwi is a multi-backend key-value store written in Go.
A B+ Tree based database storage engine, written in Go.
B+ Tree indexing engine with leaf key pagination, range queries, exact point lookups, and split rebalancing.
🌲 Improved Interval B+ tree implementation, in TS 🌲
Memory-resident B+ tree implementation, supporting insertion, key based search, bound based search and range search operations.
B+ Tree indexing engine with leaf key pagination, range queries, exact point lookups, and split rebalancing.
Encrypted Key-Value Store
An educational Rust project to implement an SQLite-like database from scratch, exploring database concepts such as indexes, Write-Ahead Logging (WAL), and RAFT
To associate your repository with the b-plus-tree topic, visit your repo's landing page and select "manage topics."