An open sourced implementation of Bw-Tree in SQL Server Hekaton

A relational database engine using B+ tree indexing

Database implementation from the scratch. The textbook is shown in the following link.

DEX: Scalable Range Indexing on Disaggregated Memory

Task-based framework for automatic synchronization and memory prefetching.

In-memory index implementation (btreemap, hashmap, ART-map)

Clean and fast binary search tree ('B-Tree') implementation suitable for usage in fast on disk storage engines for providing fast and as direct as possible access on items.

Index records comprise search-key values and data pointers. Multilevel index is stored on the disk along with the actual database files.

FlexiBase Shell (a close to real database inspired by MongoDb) that is a testament to the power of C++ and custom-built data structures from scratch.

Indexing on B tree, AVL tree and Red Black tree. 🌳 Final Project @ Data Structures

An ultra-light and low foot-print SQLite-like DBMS entirely implemented in C++

A repository for files assignment about B-Tree

BlockDB: A high-performance relational database engine with block-based storage, B+ tree indexing, and memory-optimized query processing.

This repository contains a fully functional B-Tree implemented in C++. It showcases key computer science concepts, including self-balancing trees, recursion, dynamic memory management, and in-order traversal. Includes ASCII diagrams and detailed documentation for educational purposes.