There are 1 repository under b-plus-tree topic.
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
Waterwheel is a distributed append-only store supporting millions insertions per second and realtime temporal and key range query
A growable array (vector) implemented as a B-tree
Memory-resident B+ tree implementation, supporting insertion, key based search, bound based search and range search operations.
:evergreen_tree: Improved Interval B+ tree implementation, in TS :evergreen_tree:
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
Hybrid B+ Tree and HNSW index for efficient k-NN search with scalar filtering using probabilistic optimization
Project developed in C for Algorithms and Data Structures II discipline.
Database Fall 2019, MOOCbase skeleton code
Data Structures implementations
A simple relational database based on B+ Tree Indexing
Implementação de árvore B+ para um sistema de arquivo de filmes.
SUTD 2021 50.043 Database and Big Data Systems Code Dump
Implementation of a B+ tree in C, as a project in "Implementation of Database Management Systems" course.
🅱️ ➕ 🌳 Implementation of a B+ tree in C, as a project in "Implementation of Database Management Systems" course.
SnapTrees is an interactive tool to visualize tree data structures and their operations like insertion, deletion, and search in real-time.
Data-Systems-Project || B+Tree indexing, covering insertion, deletion, range and analysis.B+Tree supports only Integer value.