concurrent KV-store with a B+-tree index
-
Updated
Sep 21, 2019 - C++
concurrent KV-store with a B+-tree index
A simplified relational database management system with support for integer-only tables and matrices. Supports linear hash and B+ tree indices, two-phase merge sort, buffer management and aggregate queries.
A disk-based B+ tree implementation that supports concurrency and transactions
Add a description, image, and links to the btree-index topic page so that developers can more easily learn about it.
To associate your repository with the btree-index topic, visit your repo's landing page and select "manage topics."