Mini Database System using B+ Tree in C++ (Simple & Self-Explanatory Code)

A relational database engine using B+ tree indexing

A tiny embedded, transactional key-value database 🐱

C++ implementation of B+ Tree.

🌲 Fully unit-tested B+ tree with basic paging implemented in C++

In- Memory- Database. Implementation of Multilevel Indexing using B+ trees for fast updation and retrieval of data.

Here is a implementation code dynamic b plus tree code in c++

Implements B+Tree for storing,indexing and retrieval of records.GUI Implemented by using .NET Framework(Winforms)

Common engineering data structures and algorithms, such as linear,tree,linked list,graph,greedy,divide and conquer,dynamic programming, backtracking, depth search, breadth search and so on

Generic BTree with support for different values on keys and data

Implements B+Tree for storing,indexing and retrieval of records.

This application manages the data of the different products of the Amazon store.

A disk-based B+ tree implementation that supports concurrency and transactions

Developed and tested a small degree B+ tree in C++ for information storage and retrieval used for internal-memory dictionaries with operations like insert, search, delete, etc.

Piroto is a new compound index that is faster than MongoDB's.

Implementation of data structures such as hash table, avl tree, b+ tree