A relational database engine using B+ tree indexing
-
Updated
Aug 8, 2021 - C++
A relational database engine using B+ tree indexing
Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
Memory-resident B+ tree implementation, supporting insertion, key based search, bound based search and range search operations.
This is the implementation repository of our accepted SOSP'24 paper: CHIME: A Cache-Efficient and High-Performance Hybrid Index on Disaggregated Memory.
Data Structures implementations
A simple relational database based on B+ Tree Indexing
Deprecated, refer to https://github.com/BestSonny/B-plusTree Implementation of B+ Tree (In-memory)
3-1 FileProcessing Assignment
Implemented B+ Tree for executing range queries on large SQL records
B+ self-balancing tree implementation using C++
Add a description, image, and links to the b-plus-tree topic page so that developers can more easily learn about it.
To associate your repository with the b-plus-tree topic, visit your repo's landing page and select "manage topics."